Base | Representation |
---|---|
bin | 1001000110000101011111… |
… | …00100001001110000000111 |
3 | 2121211000022012211201212022 |
4 | 10203002233210021300013 |
5 | 10110141120141020403 |
6 | 110312003403313355 |
7 | 4132655256242006 |
oct | 443025744116007 |
9 | 77730265751768 |
10 | 20000313220103 |
11 | 64110a3450a27 |
12 | 22b024051b85b |
13 | b2103815cc88 |
14 | 4d203dab2c3d |
15 | 24a3c2606d38 |
hex | 1230af909c07 |
20000313220103 has 8 divisors (see below), whose sum is σ = 20705570777280. Its totient is φ = 19296095101920.
The previous prime is 20000313220079. The next prime is 20000313220163. The reversal of 20000313220103 is 30102231300002.
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 20000313220103 - 230 = 19999239478279 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000313220163) 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 7 ways as a sum of consecutive naturals, for example, 259820588 + ... + 259897553.
It is an arithmetic number, because the mean of its divisors is an integer number (2588196347160).
Almost surely, 220000313220103 is an apocalyptic number.
20000313220103 is a deficient number, since it is larger than the sum of its proper divisors (705257557177).
20000313220103 is a wasteful number, since it uses less digits than its factorization.
20000313220103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519719497.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 20000313220103 its reverse (30102231300002), we get a palindrome (50102544520105).
The spelling of 20000313220103 in words is "twenty trillion, three hundred thirteen million, two hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •