Base | Representation |
---|---|
bin | 1101101000000010000011… |
… | …10010110001000010101101 |
3 | 10221002102012202012200110222 |
4 | 12310001001302301002231 |
5 | 12411402301143342023 |
6 | 143420415053341125 |
7 | 6211512003046523 |
oct | 664010162610255 |
9 | 127072182180428 |
10 | 29962795684013 |
11 | 9602172042875 |
12 | 343aba77977a5 |
13 | 13946306355aa |
14 | 7582c81dc313 |
15 | 36e603977cc8 |
hex | 1b4041cb10ad |
29962795684013 has 32 divisors (see below), whose sum is σ = 33234585845760. Its totient is φ = 26884811796480.
The previous prime is 29962795683883. The next prime is 29962795684039. The reversal of 29962795684013 is 31048659726992.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 29962795684013 - 212 = 29962795679917 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 (29962795684313) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 426354068 + ... + 426424338.
It is an arithmetic number, because the mean of its divisors is an integer number (1038580807680).
It is a 1-persistent number, because it is pandigital, but 2⋅29962795684013 = 59925591368026 is not.
Almost surely, 229962795684013 is an apocalyptic number.
29962795684013 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
29962795684013 is a deficient number, since it is larger than the sum of its proper divisors (3271790161747).
29962795684013 is a wasteful number, since it uses less digits than its factorization.
29962795684013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 79889.
The product of its (nonzero) digits is 352719360, while the sum is 71.
The spelling of 29962795684013 in words is "twenty-nine trillion, nine hundred sixty-two billion, seven hundred ninety-five million, six hundred eighty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •