Base | Representation |
---|---|
bin | 1101001111001111011110… |
… | …11110001000110101000101 |
3 | 10211001222121102002110020002 |
4 | 12213213233132020311011 |
5 | 12303423322310120401 |
6 | 141525225220051045 |
7 | 6063125663630123 |
oct | 647475736106505 |
9 | 124058542073202 |
10 | 29111011020101 |
11 | 9303a0188667a |
12 | 3321aaa833a85 |
13 | 1332205c6876a |
14 | 728da2502913 |
15 | 35739e2b6a6b |
hex | 1a79ef788d45 |
29111011020101 has 8 divisors (see below), whose sum is σ = 29306024024064. Its totient is φ = 28916027290800.
The previous prime is 29111011020043. The next prime is 29111011020149. The reversal of 29111011020101 is 10102011011192.
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 29111011020101 - 218 = 29111010757957 is a prime.
It is a super-2 number, since 2×291110110201012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29111011020151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5321366 + ... + 9302631.
It is an arithmetic number, because the mean of its divisors is an integer number (3663253003008).
Almost surely, 229111011020101 is an apocalyptic number.
It is an amenable number.
29111011020101 is a deficient number, since it is larger than the sum of its proper divisors (195013003963).
29111011020101 is a wasteful number, since it uses less digits than its factorization.
29111011020101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14637331.
The product of its (nonzero) digits is 36, while the sum is 20.
Adding to 29111011020101 its reverse (10102011011192), we get a palindrome (39213022031293).
The spelling of 29111011020101 in words is "twenty-nine trillion, one hundred eleven billion, eleven million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •