Base | Representation |
---|---|
bin | 1001000110110001100111… |
… | …0001101001001010001100 |
3 | 1022110010201120121221101102 |
4 | 2101230121301221022030 |
5 | 2303014034302223040 |
6 | 33143241100402232 |
7 | 2052225503063564 |
oct | 221543161511214 |
9 | 38403646557342 |
10 | 10012001211020 |
11 | 321007a742536 |
12 | 1158486b46378 |
13 | 578187625313 |
14 | 268824d83da4 |
15 | 12567d852515 |
hex | 91b19c6928c |
10012001211020 has 96 divisors (see below), whose sum is σ = 21521302387200. Its totient is φ = 3911218333184.
The previous prime is 10012001210993. The next prime is 10012001211071. The reversal of 10012001211020 is 2011210021001.
It is a junction number, because it is equal to n+sod(n) for n = 10012001210992 and 10012001211010.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 389968904 + ... + 389994576.
It is an arithmetic number, because the mean of its divisors is an integer number (224180233200).
Almost surely, 210012001211020 is an apocalyptic number.
10012001211020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10012001211020 is an abundant number, since it is smaller than the sum of its proper divisors (11509301176180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10012001211020 is a wasteful number, since it uses less digits than its factorization.
10012001211020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27887 (or 27885 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 10012001211020 its reverse (2011210021001), we get a palindrome (12023211232021).
The spelling of 10012001211020 in words is "ten trillion, twelve billion, one million, two hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •