Base | Representation |
---|---|
bin | 11110100101101001000… |
… | …101010111011011101001 |
3 | 21102221122010122110021020 |
4 | 132211221011113123221 |
5 | 233414400004201441 |
6 | 4245351342203053 |
7 | 304602366246531 |
oct | 36455105273351 |
9 | 7387563573236 |
10 | 2102002022121 |
11 | 7404aa384821 |
12 | 29b470283489 |
13 | 1232aaa78691 |
14 | 73a477744c1 |
15 | 39a27d78e66 |
hex | 1e9691576e9 |
2102002022121 has 8 divisors (see below), whose sum is σ = 2899313134080. Its totient is φ = 1353012795792.
The previous prime is 2102002022111. The next prime is 2102002022171. The reversal of 2102002022121 is 1212202002012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2102002022121 - 214 = 2102002005737 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2102002022121.
It is not an unprimeable number, because it can be changed into a prime (2102002022111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12080471305 + ... + 12080471478.
It is an arithmetic number, because the mean of its divisors is an integer number (362414141760).
Almost surely, 22102002022121 is an apocalyptic number.
It is an amenable number.
2102002022121 is a deficient number, since it is larger than the sum of its proper divisors (797311111959).
2102002022121 is a wasteful number, since it uses less digits than its factorization.
2102002022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24160942815.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2102002022121 its reverse (1212202002012), we get a palindrome (3314204024133).
The spelling of 2102002022121 in words is "two trillion, one hundred two billion, two million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •