Base | Representation |
---|---|
bin | 1001000110000101011110… |
… | …11000010101001001001001 |
3 | 2121211000022000000021201221 |
4 | 10203002233120111021021 |
5 | 10110141113342333113 |
6 | 110312003213042041 |
7 | 4132655221013554 |
oct | 443025730251111 |
9 | 77730260007657 |
10 | 20000310121033 |
11 | 64110a1724610 |
12 | 22b023b486321 |
13 | b210376164c8 |
14 | 4d203d50769b |
15 | 24a3c21e398d |
hex | 1230af615249 |
20000310121033 has 64 divisors (see below), whose sum is σ = 24388965216000. Its totient is φ = 16164552499200.
The previous prime is 20000310121031. The next prime is 20000310121049. The reversal of 20000310121033 is 33012101300002.
It is a cyclic number.
It is not a de Polignac number, because 20000310121033 - 21 = 20000310121031 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20000310120998 and 20000310121016.
It is not an unprimeable number, because it can be changed into a prime (20000310121031) 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 63 ways as a sum of consecutive naturals, for example, 2635430403 + ... + 2635437991.
It is an arithmetic number, because the mean of its divisors is an integer number (381077581500).
Almost surely, 220000310121033 is an apocalyptic number.
It is an amenable number.
20000310121033 is a deficient number, since it is larger than the sum of its proper divisors (4388655094967).
20000310121033 is a wasteful number, since it uses less digits than its factorization.
20000310121033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9706.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 20000310121033 its reverse (33012101300002), we get a palindrome (53012411421035).
The spelling of 20000310121033 in words is "twenty trillion, three hundred ten million, one hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •