Base | Representation |
---|---|
bin | 10111001100010100110010… |
… | …010010110011010001101001 |
3 | 111101011022001022002210212221 |
4 | 113030110302102303101221 |
5 | 101332200120124231441 |
6 | 1000535025420234041 |
7 | 30325255124214631 |
oct | 2714246222632151 |
9 | 441138038083787 |
10 | 102002022102121 |
11 | 2a5568a6320239 |
12 | b53481299b921 |
13 | 44bb9985c283b |
14 | 1b28cd20716c1 |
15 | bbd4900788d1 |
hex | 5cc5324b3469 |
102002022102121 has 16 divisors (see below), whose sum is σ = 109438214054400. Its totient is φ = 94773990100608.
The previous prime is 102002022102119. The next prime is 102002022102139. The reversal of 102002022102121 is 121201220200201.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 102002022102121 - 21 = 102002022102119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102002022102095 and 102002022102104.
It is not an unprimeable number, because it can be changed into a prime (102002022102161) 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, 16717561 + ... + 21988198.
It is an arithmetic number, because the mean of its divisors is an integer number (6839888378400).
Almost surely, 2102002022102121 is an apocalyptic number.
It is an amenable number.
102002022102121 is a deficient number, since it is larger than the sum of its proper divisors (7436191952279).
102002022102121 is a wasteful number, since it uses less digits than its factorization.
102002022102121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38708448.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102002022102121 its reverse (121201220200201), we get a palindrome (223203242302322).
The spelling of 102002022102121 in words is "one hundred two trillion, two billion, twenty-two million, one hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •