Base | Representation |
---|---|
bin | 1001000111010011001000… |
… | …1001010011011001010111 |
3 | 1022110222221201102211201022 |
4 | 2101310302021103121113 |
5 | 2303141002000013421 |
6 | 33151330035551355 |
7 | 2052664502405321 |
oct | 221646211233127 |
9 | 38428851384638 |
10 | 10021000001111 |
11 | 3213978287740 |
12 | 115a17875b55b |
13 | 578c8ca70998 |
14 | 26903a162611 |
15 | 125a088907ab |
hex | 91d32253657 |
10021000001111 has 4 divisors (see below), whose sum is σ = 10932000001224. Its totient is φ = 9110000001000.
The previous prime is 10021000001087. The next prime is 10021000001113. The reversal of 10021000001111 is 11110000012001.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10021000001111 - 214 = 10020999984727 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 (10021000001113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 455500000040 + ... + 455500000061.
It is an arithmetic number, because the mean of its divisors is an integer number (2733000000306).
Almost surely, 210021000001111 is an apocalyptic number.
10021000001111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10021000001111 is a deficient number, since it is larger than the sum of its proper divisors (911000000113).
10021000001111 is an equidigital number, since it uses as much as digits as its factorization.
10021000001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 911000000112.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 10021000001111 its reverse (11110000012001), we get a palindrome (21131000013112).
The spelling of 10021000001111 in words is "ten trillion, twenty-one billion, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •