Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …111111001001101001011011 |
3 | 111101120120121011020111011212 |
4 | 113032002222333021221123 |
5 | 101341113240321023003 |
6 | 1001105141354213335 |
7 | 30336633034230314 |
oct | 2716025277115133 |
9 | 441516534214155 |
10 | 102120011111003 |
11 | 2a5a1943010a26 |
12 | b55366112424b |
13 | 44c9b4cc84b22 |
14 | 1b308c629b60b |
15 | bc15986e9dd8 |
hex | 5ce0aafc9a5b |
102120011111003 has 4 divisors (see below), whose sum is σ = 102191473681440. Its totient is φ = 102048548540568.
The previous prime is 102120011110973. The next prime is 102120011111087. The reversal of 102120011111003 is 300111110021201.
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 102120011111003 - 218 = 102120010848859 is a prime.
It is a super-2 number, since 2×1021200111110032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102120011011003) 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, 35731283075 + ... + 35731285932.
It is an arithmetic number, because the mean of its divisors is an integer number (25547868420360).
Almost surely, 2102120011111003 is an apocalyptic number.
102120011111003 is a deficient number, since it is larger than the sum of its proper divisors (71462570437).
102120011111003 is an equidigital number, since it uses as much as digits as its factorization.
102120011111003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71462570436.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 102120011111003 its reverse (300111110021201), we get a palindrome (402231121132204).
The spelling of 102120011111003 in words is "one hundred two trillion, one hundred twenty billion, eleven million, one hundred eleven thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •