Base | Representation |
---|---|
bin | 11110100101110101000… |
… | …000010000100110100111 |
3 | 21102222011001221220002120 |
4 | 132211311000100212213 |
5 | 233420302203310043 |
6 | 4245423244441023 |
7 | 304610345153613 |
oct | 36456500204647 |
9 | 7388131856076 |
10 | 2102202010023 |
11 | 7405a2259685 |
12 | 29b507249173 |
13 | 12331032a30b |
14 | 73a66152343 |
15 | 39a3a6ce983 |
hex | 1e9750109a7 |
2102202010023 has 8 divisors (see below), whose sum is σ = 2809320835200. Its totient is φ = 1398275595768.
The previous prime is 2102202009907. The next prime is 2102202010031. The reversal of 2102202010023 is 3200102022012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2102202010023 - 210 = 2102202008999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2102202009984 and 2102202010011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102202010823) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 798101193 + ... + 798103826.
It is an arithmetic number, because the mean of its divisors is an integer number (351165104400).
Almost surely, 22102202010023 is an apocalyptic number.
2102202010023 is a deficient number, since it is larger than the sum of its proper divisors (707118825177).
2102202010023 is a wasteful number, since it uses less digits than its factorization.
2102202010023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1596205461.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 2102202010023 its reverse (3200102022012), we get a palindrome (5302304032035).
The spelling of 2102202010023 in words is "two trillion, one hundred two billion, two hundred two million, ten thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •