Base | Representation |
---|---|
bin | 1001000110101010001100… |
… | …01111011010011010011011 |
3 | 2121212220011200112022010021 |
4 | 10203111012033122122123 |
5 | 10111002000334341443 |
6 | 110325023133531311 |
7 | 4134253532561416 |
oct | 443250617323233 |
9 | 77786150468107 |
10 | 20020021012123 |
11 | 6419496a38850 |
12 | 22b4020643b37 |
13 | b22b59137682 |
14 | 4d2d8d252b7d |
15 | 24ab778a29ed |
hex | 1235463da69b |
20020021012123 has 32 divisors (see below), whose sum is σ = 22094747136000. Its totient is φ = 17988400128000.
The previous prime is 20020021012111. The next prime is 20020021012177. The reversal of 20020021012123 is 32121012002002.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20020021012123 - 233 = 20011431077531 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20020021012097 and 20020021012106.
It is not an unprimeable number, because it can be changed into a prime (20020021013123) 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 31 ways as a sum of consecutive naturals, for example, 2818526790 + ... + 2818533892.
It is an arithmetic number, because the mean of its divisors is an integer number (690460848000).
Almost surely, 220020021012123 is an apocalyptic number.
20020021012123 is a deficient number, since it is larger than the sum of its proper divisors (2074726123877).
20020021012123 is a wasteful number, since it uses less digits than its factorization.
20020021012123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11283.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 20020021012123 its reverse (32121012002002), we get a palindrome (52141033014125).
The spelling of 20020021012123 in words is "twenty trillion, twenty billion, twenty-one million, twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •