Base | Representation |
---|---|
bin | 1101010011011001001101… |
… | …10000110000110001110001 |
3 | 10211120121211201222002000022 |
4 | 12221230212300300301301 |
5 | 12313243010134214334 |
6 | 142114541320133225 |
7 | 6106336164041051 |
oct | 651544660606161 |
9 | 124517751862008 |
10 | 29253672569969 |
11 | 935945a584601 |
12 | 3345683907215 |
13 | 13427c0070c23 |
14 | 731c573d5561 |
15 | 35ae4d9c582e |
hex | 1a9b26c30c71 |
29253672569969 has 2 divisors, whose sum is σ = 29253672569970. Its totient is φ = 29253672569968.
The previous prime is 29253672569909. The next prime is 29253672569983. The reversal of 29253672569969 is 96996527635292.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25277636569969 + 3976036000000 = 5027687^2 + 1994000^2 .
It is a cyclic number.
It is not a de Polignac number, because 29253672569969 - 232 = 29249377602673 is a prime.
It is a super-2 number, since 2×292536725699692 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 29253672569893 and 29253672569902.
It is not a weakly prime, because it can be changed into another prime (29253672569909) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14626836284984 + 14626836284985.
It is an arithmetic number, because the mean of its divisors is an integer number (14626836284985).
Almost surely, 229253672569969 is an apocalyptic number.
It is an amenable number.
29253672569969 is a deficient number, since it is larger than the sum of its proper divisors (1).
29253672569969 is an equidigital number, since it uses as much as digits as its factorization.
29253672569969 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5952139200, while the sum is 80.
The spelling of 29253672569969 in words is "twenty-nine trillion, two hundred fifty-three billion, six hundred seventy-two million, five hundred sixty-nine thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •