Base | Representation |
---|---|
bin | 1001001101000100010100… |
… | …0101111000111010010111 |
3 | 1022211110202022120011011012 |
4 | 2103101011011320322113 |
5 | 2311301432120333421 |
6 | 33305035530202435 |
7 | 2063103364465013 |
oct | 223210505707227 |
9 | 38743668504135 |
10 | 10120102121111 |
11 | 3251a028a9254 |
12 | 117541588341b |
13 | 585424549988 |
14 | 26db5bc59543 |
15 | 1283a8d6b95b |
hex | 93445178e97 |
10120102121111 has 16 divisors (see below), whose sum is σ = 10483388647200. Its totient is φ = 9757773879168.
The previous prime is 10120102121089. The next prime is 10120102121131. The reversal of 10120102121111 is 11112120102101.
It is a cyclic number.
It is not a de Polignac number, because 10120102121111 - 26 = 10120102121047 is a prime.
It is a super-3 number, since 3×101201021211113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120102121131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 169505981 + ... + 169565673.
It is an arithmetic number, because the mean of its divisors is an integer number (655211790450).
Almost surely, 210120102121111 is an apocalyptic number.
10120102121111 is a deficient number, since it is larger than the sum of its proper divisors (363286526089).
10120102121111 is an equidigital number, since it uses as much as digits as its factorization.
10120102121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67618.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10120102121111 its reverse (11112120102101), we get a palindrome (21232222223212).
The spelling of 10120102121111 in words is "ten trillion, one hundred twenty billion, one hundred two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •