Base | Representation |
---|---|
bin | 11110100101101001100… |
… | …100010000101100111110 |
3 | 21102221122200212220212112 |
4 | 132211221210100230332 |
5 | 233414404042333042 |
6 | 4245352231534022 |
7 | 304602525140510 |
oct | 36455144205476 |
9 | 7387580786775 |
10 | 2102010121022 |
11 | 740503a06629 |
12 | 29b472b2a312 |
13 | 1232ac652b26 |
14 | 73a48881bb0 |
15 | 39a28928982 |
hex | 1e969910b3e |
2102010121022 has 8 divisors (see below), whose sum is σ = 3603445921776. Its totient is φ = 900861480432.
The previous prime is 2102010121021. The next prime is 2102010121031. The reversal of 2102010121022 is 2201210102012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 150143580073 = 2102010121022 / (2 + 1 + 0 + 2 + 0 + 1 + 0 + 1 + 2 + 1 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 2102010120988 and 2102010121006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102010121021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75071790023 + ... + 75071790050.
It is an arithmetic number, because the mean of its divisors is an integer number (450430740222).
Almost surely, 22102010121022 is an apocalyptic number.
2102010121022 is a deficient number, since it is larger than the sum of its proper divisors (1501435800754).
2102010121022 is a wasteful number, since it uses less digits than its factorization.
2102010121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150143580082.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 2102010121022 its reverse (2201210102012), we get a palindrome (4303220223034).
The spelling of 2102010121022 in words is "two trillion, one hundred two billion, ten million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •