Base | Representation |
---|---|
bin | 1101011000000101000111… |
… | …01111111110000010000001 |
3 | 10212011000102212001211112101 |
4 | 12230002203233332002001 |
5 | 12323412232411212230 |
6 | 142320530255030401 |
7 | 6124066162512643 |
oct | 654024357760201 |
9 | 125130385054471 |
10 | 29414683304065 |
11 | 94107739821a4 |
12 | 3370919b0b401 |
13 | 1354a3c835757 |
14 | 73996d24c893 |
15 | 360224064aca |
hex | 1ac0a3bfe081 |
29414683304065 has 16 divisors (see below), whose sum is σ = 35964201648528. Its totient is φ = 23087373394176.
The previous prime is 29414683304063. The next prime is 29414683304081. The reversal of 29414683304065 is 56040338641492.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 110465828496 + 29304217475569 = 332364^2 + 5413337^2 .
It is a cyclic number.
It is not a de Polignac number, because 29414683304065 - 21 = 29414683304063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 29414683303997 and 29414683304015.
It is not an unprimeable number, because it can be changed into a prime (29414683304063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15891319 + ... + 17645491.
It is an arithmetic number, because the mean of its divisors is an integer number (2247762603033).
Almost surely, 229414683304065 is an apocalyptic number.
It is an amenable number.
29414683304065 is a deficient number, since it is larger than the sum of its proper divisors (6549518344463).
29414683304065 is a wasteful number, since it uses less digits than its factorization.
29414683304065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1817508.
The product of its (nonzero) digits is 14929920, while the sum is 55.
The spelling of 29414683304065 in words is "twenty-nine trillion, four hundred fourteen billion, six hundred eighty-three million, three hundred four thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •