Base | Representation |
---|---|
bin | 1001000110111110101010… |
… | …11011010110111011000001 |
3 | 2121220221112202022022121202 |
4 | 10203133111123112323001 |
5 | 10111142003341020113 |
6 | 110334042003030545 |
7 | 4135123116031664 |
oct | 443372533267301 |
9 | 77827482268552 |
10 | 20031013220033 |
11 | 64231178342a2 |
12 | 22b618996b455 |
13 | b23bbb5643ca |
14 | 4d37130956db |
15 | 24b0bc903258 |
hex | 1237d56d6ec1 |
20031013220033 has 16 divisors (see below), whose sum is σ = 20890241231616. Its totient is φ = 19191498418560.
The previous prime is 20031013219979. The next prime is 20031013220041. The reversal of 20031013220033 is 33002231013002.
It is a cyclic number.
It is not a de Polignac number, because 20031013220033 - 26 = 20031013219969 is a prime.
It is a super-2 number, since 2×200310132200332 (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 = 20031013219987 and 20031013220014.
It is not an unprimeable number, because it can be changed into a prime (20031013220063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7972508 + ... + 10179533.
It is an arithmetic number, because the mean of its divisors is an integer number (1305640076976).
Almost surely, 220031013220033 is an apocalyptic number.
It is an amenable number.
20031013220033 is a deficient number, since it is larger than the sum of its proper divisors (859228011583).
20031013220033 is a wasteful number, since it uses less digits than its factorization.
20031013220033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18152584.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 20031013220033 its reverse (33002231013002), we get a palindrome (53033244233035).
The spelling of 20031013220033 in words is "twenty trillion, thirty-one billion, thirteen million, two hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •