Base | Representation |
---|---|
bin | 1001001110110100010000… |
… | …10110010110011000011001 |
3 | 2122212200122000112120210022 |
4 | 10213122020112112120121 |
5 | 10130100010032013423 |
6 | 111101455213400225 |
7 | 4163435301303362 |
oct | 447321026263031 |
9 | 78780560476708 |
10 | 20300303001113 |
11 | 65173458a8583 |
12 | 233a402499075 |
13 | b43405b21435 |
14 | 50277b714b69 |
15 | 2530cde47dc8 |
hex | 127688596619 |
20300303001113 has 8 divisors (see below), whose sum is σ = 20578500310368. Its totient is φ = 20022108691104.
The previous prime is 20300303001091. The next prime is 20300303001149. The reversal of 20300303001113 is 31110030300302.
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 20300303001113 - 220 = 20300301952537 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20300303001091 and 20300303001100.
It is not an unprimeable number, because it can be changed into a prime (20300303009113) 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, 15184070 + ... + 16466832.
It is an arithmetic number, because the mean of its divisors is an integer number (2572312538796).
Almost surely, 220300303001113 is an apocalyptic number.
It is an amenable number.
20300303001113 is a deficient number, since it is larger than the sum of its proper divisors (278197309255).
20300303001113 is a wasteful number, since it uses less digits than its factorization.
20300303001113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1499623.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 20300303001113 its reverse (31110030300302), we get a palindrome (51410333301415).
The spelling of 20300303001113 in words is "twenty trillion, three hundred billion, three hundred three million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •