Base | Representation |
---|---|
bin | 1001000110001000110110… |
… | …10101100011100100011111 |
3 | 2121211011222020010101111111 |
4 | 10203010123111203210133 |
5 | 10110203321030124043 |
6 | 110312503033402451 |
7 | 4133051133036154 |
oct | 443043325434437 |
9 | 77734866111444 |
10 | 20002121333023 |
11 | 6411941046a25 |
12 | 22b0665b69427 |
13 | b2126593098b |
14 | 4d2171c9c22b |
15 | 24a47b21409d |
hex | 12311b56391f |
20002121333023 has 4 divisors (see below), whose sum is σ = 20024077559328. Its totient is φ = 19980165106720.
The previous prime is 20002121332987. The next prime is 20002121333053. The reversal of 20002121333023 is 32033312120002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20002121333023 - 29 = 20002121332511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20002121332985 and 20002121333003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002121333053) 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, 10978111786 + ... + 10978113607.
It is an arithmetic number, because the mean of its divisors is an integer number (5006019389832).
Almost surely, 220002121333023 is an apocalyptic number.
20002121333023 is a deficient number, since it is larger than the sum of its proper divisors (21956226305).
20002121333023 is an equidigital number, since it uses as much as digits as its factorization.
20002121333023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21956226304.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 20002121333023 its reverse (32033312120002), we get a palindrome (52035433453025).
The spelling of 20002121333023 in words is "twenty trillion, two billion, one hundred twenty-one million, three hundred thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •