Base | Representation |
---|---|
bin | 101111100000001010… |
… | …1111000100110001001 |
3 | 100202022100002101212110 |
4 | 1133000111320212021 |
5 | 3132404332210441 |
6 | 114510250132533 |
7 | 10240634656602 |
oct | 1370025704611 |
9 | 322270071773 |
10 | 102011210121 |
11 | 3a29873a027 |
12 | 1792b421149 |
13 | 98093b03c2 |
14 | 4d1a1d6da9 |
15 | 29c0ab3b16 |
hex | 17c0578989 |
102011210121 has 16 divisors (see below), whose sum is σ = 147043188800. Its totient is φ = 62686830528.
The previous prime is 102011210053. The next prime is 102011210141. The reversal of 102011210121 is 121012110201.
It is not a de Polignac number, because 102011210121 - 211 = 102011208073 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102011210097 and 102011210106.
It is not an unprimeable number, because it can be changed into a prime (102011210141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24182626 + ... + 24186843.
It is an arithmetic number, because the mean of its divisors is an integer number (9190199300).
Almost surely, 2102011210121 is an apocalyptic number.
It is an amenable number.
102011210121 is a deficient number, since it is larger than the sum of its proper divisors (45031978679).
102011210121 is a wasteful number, since it uses less digits than its factorization.
102011210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48369528.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102011210121 its reverse (121012110201), we get a palindrome (223023320322).
It can be divided in two parts, 10201 and 1210121, that multiplied together give a palindrome (12344444321).
The spelling of 102011210121 in words is "one hundred two billion, eleven million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •