Base | Representation |
---|---|
bin | 110111111011101011… |
… | …0111100000000100111 |
3 | 102111000221212121102222 |
4 | 1233313112330000213 |
5 | 3431443202233221 |
6 | 131102450022555 |
7 | 11451353011130 |
oct | 1576726740047 |
9 | 374027777388 |
10 | 120114102311 |
11 | 46a38308955 |
12 | 1b341b77a5b |
13 | b432a27a28 |
14 | 5b56568c87 |
15 | 31ceee39ab |
hex | 1bf75bc027 |
120114102311 has 4 divisors (see below), whose sum is σ = 137273259792. Its totient is φ = 102954944832.
The previous prime is 120114102257. The next prime is 120114102319. The reversal of 120114102311 is 113201411021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 113201411021 = 503 ⋅225052507.
It is a cyclic number.
It is not a de Polignac number, because 120114102311 - 26 = 120114102247 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 120114102311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120114102319) 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, 8579578730 + ... + 8579578743.
It is an arithmetic number, because the mean of its divisors is an integer number (34318314948).
Almost surely, 2120114102311 is an apocalyptic number.
120114102311 is a deficient number, since it is larger than the sum of its proper divisors (17159157481).
120114102311 is an equidigital number, since it uses as much as digits as its factorization.
120114102311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17159157480.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 120114102311 its reverse (113201411021), we get a palindrome (233315513332).
The spelling of 120114102311 in words is "one hundred twenty billion, one hundred fourteen million, one hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •