Base | Representation |
---|---|
bin | 1001000110001010100010… |
… | …00001010101001111001111 |
3 | 2121211021021222220001211112 |
4 | 10203011101001111033033 |
5 | 10110212142113013403 |
6 | 110313132250042235 |
7 | 4133112350426501 |
oct | 443052101251717 |
9 | 77737258801745 |
10 | 20003022001103 |
11 | 6412263495209 |
12 | 22b087771937b |
13 | b2137a3cc47b |
14 | 4d221974dd71 |
15 | 24a4d03239d8 |
hex | 1231510553cf |
20003022001103 has 8 divisors (see below), whose sum is σ = 21130214803200. Its totient is φ = 18883269416088.
The previous prime is 20003022001093. The next prime is 20003022001307. The reversal of 20003022001103 is 30110022030002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20003022001103 - 214 = 20003021984719 is a prime.
It is a super-2 number, since 2×200030220011032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20003022001603) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1860048743 + ... + 1860059496.
It is an arithmetic number, because the mean of its divisors is an integer number (2641276850400).
Almost surely, 220003022001103 is an apocalyptic number.
20003022001103 is a deficient number, since it is larger than the sum of its proper divisors (1127192802097).
20003022001103 is a wasteful number, since it uses less digits than its factorization.
20003022001103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3720108541.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 20003022001103 its reverse (30110022030002), we get a palindrome (50113044031105).
The spelling of 20003022001103 in words is "twenty trillion, three billion, twenty-two million, one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •