Base | Representation |
---|---|
bin | 10111001110000011100101… |
… | …111111101100101000000110 |
3 | 111101120200011011002122112012 |
4 | 113032003211333230220012 |
5 | 101341122302241010042 |
6 | 1001105423521254222 |
7 | 30336666415125656 |
oct | 2716034577545006 |
9 | 441520134078465 |
10 | 102121001110022 |
11 | 2a5a2300923934 |
12 | b553898794372 |
13 | 44c9c7a0ccb6b |
14 | 1b3097b964366 |
15 | bc16055a2e82 |
hex | 5ce0e5feca06 |
102121001110022 has 16 divisors (see below), whose sum is σ = 153865088289792. Its totient is φ = 50832664014600.
The previous prime is 102121001110013. The next prime is 102121001110039. The reversal of 102121001110022 is 220011100121201.
It is a super-2 number, since 2×1021210011100222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102121001109979 and 102121001110006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1560083 + ... + 14376225.
It is an arithmetic number, because the mean of its divisors is an integer number (9616568018112).
Almost surely, 2102121001110022 is an apocalyptic number.
102121001110022 is a deficient number, since it is larger than the sum of its proper divisors (51744087179770).
102121001110022 is a wasteful number, since it uses less digits than its factorization.
102121001110022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12833923.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 102121001110022 its reverse (220011100121201), we get a palindrome (322132101231223).
The spelling of 102121001110022 in words is "one hundred two trillion, one hundred twenty-one billion, one million, one hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •