Base | Representation |
---|---|
bin | 100000001010000010… |
… | …1100100101000000101 |
3 | 20121020122221202012222 |
4 | 1000110011210220011 |
5 | 2112411424404142 |
6 | 51420224022125 |
7 | 4663166260502 |
oct | 1002405445005 |
9 | 217218852188 |
10 | 69056481797 |
11 | 27317646966 |
12 | 11472a61945 |
13 | 6686b24c64 |
14 | 34b15ac4a9 |
15 | 1be2889bd2 |
hex | 1014164a05 |
69056481797 has 8 divisors (see below), whose sum is σ = 71566011000. Its totient is φ = 66555504064.
The previous prime is 69056481761. The next prime is 69056481803. The reversal of 69056481797 is 79718465096.
It is a Cunningham number, because it is equal to 2627862+1.
It can be written as a sum of positive squares in 4 ways, for example, as 1 + 69056481796 = 1^2 + 262786^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 69056481797 - 220 = 69055433221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (69056481707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2121422 + ... + 2153727.
It is an arithmetic number, because the mean of its divisors is an integer number (8945751375).
Almost surely, 269056481797 is an apocalyptic number.
It is an amenable number.
69056481797 is a deficient number, since it is larger than the sum of its proper divisors (2509529203).
69056481797 is a wasteful number, since it uses less digits than its factorization.
69056481797 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4275735.
The product of its (nonzero) digits is 22861440, while the sum is 62.
The spelling of 69056481797 in words is "sixty-nine billion, fifty-six million, four hundred eighty-one thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •