Base | Representation |
---|---|
bin | 1001001101000011111110… |
… | …1110001001101001001111 |
3 | 1022211110112001000010211211 |
4 | 2103100333232021221033 |
5 | 2311301241033341421 |
6 | 33305022550555251 |
7 | 2063101221536401 |
oct | 223207756115117 |
9 | 38743461003754 |
10 | 10120012012111 |
11 | 3251966a53001 |
12 | 11753ab668b27 |
13 | 58540b98a241 |
14 | 26db4dcc0b71 |
15 | 1283a0ebc9e1 |
hex | 9343fb89a4f |
10120012012111 has 8 divisors (see below), whose sum is σ = 10587412672704. Its totient is φ = 9663114737280.
The previous prime is 10120012012093. The next prime is 10120012012139. The reversal of 10120012012111 is 11121021002101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10120012012111 - 211 = 10120012010063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10120012012091 and 10120012012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120012012171) 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, 2625844470 + ... + 2625848323.
It is an arithmetic number, because the mean of its divisors is an integer number (1323426584088).
Almost surely, 210120012012111 is an apocalyptic number.
10120012012111 is a deficient number, since it is larger than the sum of its proper divisors (467400660593).
10120012012111 is an equidigital number, since it uses as much as digits as its factorization.
10120012012111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5251692881.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10120012012111 its reverse (11121021002101), we get a palindrome (21241033014212).
The spelling of 10120012012111 in words is "ten trillion, one hundred twenty billion, twelve million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •