Base | Representation |
---|---|
bin | 1101001100000100101001… |
… | …11001011001010000001001 |
3 | 10210200120112102021002111102 |
4 | 12212002110321121100021 |
5 | 12300132314004144301 |
6 | 141403215544511145 |
7 | 6052222334124605 |
oct | 646022471312011 |
9 | 123616472232442 |
10 | 29002117256201 |
11 | 9271802120081 |
12 | 330497a47b4b5 |
13 | 1324b709c3b3b |
14 | 7239d2202505 |
15 | 354629387b6b |
hex | 1a6094e59409 |
29002117256201 has 2 divisors, whose sum is σ = 29002117256202. Its totient is φ = 29002117256200.
The previous prime is 29002117256197. The next prime is 29002117256213. The reversal of 29002117256201 is 10265271120092.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26701495687801 + 2300621568400 = 5167349^2 + 1516780^2 .
It is a cyclic number.
It is not a de Polignac number, because 29002117256201 - 22 = 29002117256197 is a prime.
It is a super-2 number, since 2×290021172562012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (29002117256261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 14501058628100 + 14501058628101.
It is an arithmetic number, because the mean of its divisors is an integer number (14501058628101).
Almost surely, 229002117256201 is an apocalyptic number.
It is an amenable number.
29002117256201 is a deficient number, since it is larger than the sum of its proper divisors (1).
29002117256201 is an equidigital number, since it uses as much as digits as its factorization.
29002117256201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 30240, while the sum is 38.
Adding to 29002117256201 its reverse (10265271120092), we get a palindrome (39267388376293).
The spelling of 29002117256201 in words is "twenty-nine trillion, two billion, one hundred seventeen million, two hundred fifty-six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •