Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …010101100100100000111001 |
3 | 111101120120120101201201012002 |
4 | 113032002222111210200321 |
5 | 101341113230023223001 |
6 | 1001105140324430345 |
7 | 30336632542462013 |
oct | 2716025225444071 |
9 | 441516511651162 |
10 | 102120000211001 |
11 | 2a5a1937946663 |
12 | b5536595483b5 |
13 | 44c9b4a939716 |
14 | 1b308c4a611b3 |
15 | bc159779546b |
hex | 5ce0aa564839 |
102120000211001 has 4 divisors (see below), whose sum is σ = 103412658441600. Its totient is φ = 100827341980404.
The previous prime is 102120000210947. The next prime is 102120000211043. The reversal of 102120000211001 is 100112000021201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102120000211001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102120000211081) 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, 646329115181 + ... + 646329115338.
It is an arithmetic number, because the mean of its divisors is an integer number (25853164610400).
Almost surely, 2102120000211001 is an apocalyptic number.
It is an amenable number.
102120000211001 is a deficient number, since it is larger than the sum of its proper divisors (1292658230599).
102120000211001 is an equidigital number, since it uses as much as digits as its factorization.
102120000211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1292658230598.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102120000211001 its reverse (100112000021201), we get a palindrome (202232000232202).
The spelling of 102120000211001 in words is "one hundred two trillion, one hundred twenty billion, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •