Base | Representation |
---|---|
bin | 1001000110000110110010… |
… | …0101000000011011011101 |
3 | 1022102001001102102121000100 |
4 | 2101201230211000123131 |
5 | 2302322013402134001 |
6 | 33134100243451313 |
7 | 2051340564151260 |
oct | 221415445003335 |
9 | 38361042377010 |
10 | 10000505505501 |
11 | 3206210710865 |
12 | 11561b9086b39 |
13 | 577074aba4c4 |
14 | 268054318cd7 |
15 | 1252094e7586 |
hex | 9186c9406dd |
10000505505501 has 48 divisors (see below), whose sum is σ = 16864255369728. Its totient is φ = 5591583360000.
The previous prime is 10000505505493. The next prime is 10000505505527. The reversal of 10000505505501 is 10550550500001.
10000505505501 is a `hidden beast` number, since 10 + 0 + 0 + 0 + 50 + 5 + 50 + 550 + 1 = 666.
It is not a de Polignac number, because 10000505505501 - 23 = 10000505505493 is a prime.
It is a super-2 number, since 2×100005055055012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000505505401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11424891 + ... + 12269031.
It is an arithmetic number, because the mean of its divisors is an integer number (351338653536).
Almost surely, 210000505505501 is an apocalyptic number.
It is an amenable number.
10000505505501 is a deficient number, since it is larger than the sum of its proper divisors (6863749864227).
10000505505501 is a wasteful number, since it uses less digits than its factorization.
10000505505501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 848202 (or 848199 counting only the distinct ones).
The product of its (nonzero) digits is 3125, while the sum is 27.
The spelling of 10000505505501 in words is "ten trillion, five hundred five million, five hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •