Base | Representation |
---|---|
bin | 1001000110101010011000… |
… | …01001110010001101011111 |
3 | 2121212220102121011120100111 |
4 | 10203111030021302031133 |
5 | 10111002201232400111 |
6 | 110325041035510451 |
7 | 4134256145632120 |
oct | 443251411621537 |
9 | 77786377146314 |
10 | 20020120200031 |
11 | 6419537a25126 |
12 | 22b40498b8427 |
13 | b22b73855643 |
14 | 4d2d9c4b2047 |
15 | 24ab81446a21 |
hex | 12354c27235f |
20020120200031 has 32 divisors (see below), whose sum is σ = 24036824908800. Its totient is φ = 16302721357824.
The previous prime is 20020120200029. The next prime is 20020120200037. The reversal of 20020120200031 is 13000202102002.
It is a cyclic number.
It is not a de Polignac number, because 20020120200031 - 21 = 20020120200029 is a prime.
It is a super-2 number, since 2×200201202000312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20020120199984 and 20020120200020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020120200037) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 675587391 + ... + 675617023.
It is an arithmetic number, because the mean of its divisors is an integer number (751150778400).
Almost surely, 220020120200031 is an apocalyptic number.
20020120200031 is a deficient number, since it is larger than the sum of its proper divisors (4016704708769).
20020120200031 is a wasteful number, since it uses less digits than its factorization.
20020120200031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57975.
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 20020120200031 its reverse (13000202102002), we get a palindrome (33020322302033).
The spelling of 20020120200031 in words is "twenty trillion, twenty billion, one hundred twenty million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •