Base | Representation |
---|---|
bin | 10010101000010001… |
… | …110100100010101101 |
3 | 1220122001101102122222 |
4 | 102220101310202231 |
5 | 311431244110013 |
6 | 13104520045125 |
7 | 1305460441043 |
oct | 225021644255 |
9 | 56561342588 |
10 | 20003113133 |
11 | 8535265a63 |
12 | 3a630037a5 |
13 | 1b6a227923 |
14 | d7a896393 |
15 | 7c1183508 |
hex | 4a84748ad |
20003113133 has 8 divisors (see below), whose sum is σ = 20906548800. Its totient is φ = 19102488768.
The previous prime is 20003113127. The next prime is 20003113139. The reversal of 20003113133 is 33131130002.
It is an interprime number because it is at equal distance from previous prime (20003113127) and next prime (20003113139).
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 20003113133 - 210 = 20003112109 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 (20003113139) 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, 688268 + ... + 716741.
It is an arithmetic number, because the mean of its divisors is an integer number (2613318600).
Almost surely, 220003113133 is an apocalyptic number.
20003113133 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
20003113133 is a deficient number, since it is larger than the sum of its proper divisors (903435667).
20003113133 is a wasteful number, since it uses less digits than its factorization.
20003113133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1405651.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 20003113133 its reverse (33131130002), we get a palindrome (53134243135).
The spelling of 20003113133 in words is "twenty billion, three million, one hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •