Base | Representation |
---|---|
bin | 1001100011101100011000… |
… | …0101101101110000000011 |
3 | 1101012122002021101201021010 |
4 | 2120323012011231300003 |
5 | 2334134022212033044 |
6 | 34203403205532003 |
7 | 2133144123000663 |
oct | 230730605556003 |
9 | 41178067351233 |
10 | 10508813392899 |
11 | 3391843217aa8 |
12 | 1218818414003 |
13 | 5b2c911ab283 |
14 | 2848b4a701a3 |
15 | 133559691bb9 |
hex | 98ec616dc03 |
10508813392899 has 64 divisors (see below), whose sum is σ = 14597993539584. Its totient is φ = 6720294660096.
The previous prime is 10508813392843. The next prime is 10508813392907. The reversal of 10508813392899 is 99829331880501.
It is a Cunningham number, because it is equal to 32417302-1.
It is not a de Polignac number, because 10508813392899 - 28 = 10508813392643 is a prime.
It is a super-2 number, since 2×105088133928992 (a number of 27 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (10508813392499) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 755316367 + ... + 755330279.
It is an arithmetic number, because the mean of its divisors is an integer number (228093649056).
Almost surely, 210508813392899 is an apocalyptic number.
10508813392899 is a deficient number, since it is larger than the sum of its proper divisors (4089180146685).
10508813392899 is a wasteful number, since it uses less digits than its factorization.
10508813392899 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14556.
The product of its (nonzero) digits is 33592320, while the sum is 66.
The spelling of 10508813392899 in words is "ten trillion, five hundred eight billion, eight hundred thirteen million, three hundred ninety-two thousand, eight hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •