Base | Representation |
---|---|
bin | 1001001101000100000001… |
… | …0000110111000100111101 |
3 | 1022211110112200010102022110 |
4 | 2103101000100313010331 |
5 | 2311301300401023401 |
6 | 33305023514004233 |
7 | 2063101362064146 |
oct | 223210020670475 |
9 | 38743480112273 |
10 | 10120021111101 |
11 | 32519710a8230 |
12 | 11753b2716679 |
13 | 585410824965 |
14 | 26db511acacd |
15 | 1283a1bb89d6 |
hex | 9344043713d |
10120021111101 has 8 divisors (see below), whose sum is σ = 14720030707104. Its totient is φ = 6133346127920.
The previous prime is 10120021111091. The next prime is 10120021111127. The reversal of 10120021111101 is 10111112002101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10120021111101 - 226 = 10119954002237 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120021111201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 153333653166 + ... + 153333653231.
It is an arithmetic number, because the mean of its divisors is an integer number (1840003838388).
Almost surely, 210120021111101 is an apocalyptic number.
10120021111101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10120021111101 is a deficient number, since it is larger than the sum of its proper divisors (4600009596003).
10120021111101 is a wasteful number, since it uses less digits than its factorization.
10120021111101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 306667306411.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 10120021111101 its reverse (10111112002101), we get a palindrome (20231133113202).
The spelling of 10120021111101 in words is "ten trillion, one hundred twenty billion, twenty-one million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •