Base | Representation |
---|---|
bin | 10111001110000010101010… |
… | …010101100010000110001101 |
3 | 111101120120120101201012121102 |
4 | 113032002222111202012031 |
5 | 101341113230022413401 |
6 | 1001105140324312445 |
7 | 30336632542421111 |
oct | 2716025225420615 |
9 | 441516511635542 |
10 | 102120000201101 |
11 | 2a5a193793a183 |
12 | b553659542725 |
13 | 44c9b4a93506c |
14 | 1b308c4a5b741 |
15 | bc159779256b |
hex | 5ce0aa56218d |
102120000201101 has 16 divisors (see below), whose sum is σ = 104637002944320. Its totient is φ = 99609508373760.
The previous prime is 102120000201073. The next prime is 102120000201127. The reversal of 102120000201101 is 101102000021201.
It is a cyclic number.
It is not a de Polignac number, because 102120000201101 - 214 = 102120000184717 is a prime.
It is a super-2 number, since 2×1021200002011012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102120000201161) 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, 169528835 + ... + 170130143.
It is an arithmetic number, because the mean of its divisors is an integer number (6539812684020).
Almost surely, 2102120000201101 is an apocalyptic number.
It is an amenable number.
102120000201101 is a deficient number, since it is larger than the sum of its proper divisors (2517002743219).
102120000201101 is an equidigital number, since it uses as much as digits as its factorization.
102120000201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 606716.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 102120000201101 its reverse (101102000021201), we get a palindrome (203222000222302).
The spelling of 102120000201101 in words is "one hundred two trillion, one hundred twenty billion, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •