Base | Representation |
---|---|
bin | 10010101000001110… |
… | …101110000011000101 |
3 | 1220121222212010101200 |
4 | 102220032232003011 |
5 | 311431042100401 |
6 | 13104450413113 |
7 | 1305450513510 |
oct | 225016560305 |
9 | 56558763350 |
10 | 20002300101 |
11 | 8534860133 |
12 | 3a62891199 |
13 | 1b6a001844 |
14 | d7a723d77 |
15 | 7c1072686 |
hex | 4a83ae0c5 |
20002300101 has 12 divisors (see below), whose sum is σ = 33019670112. Its totient is φ = 11429885736.
The previous prime is 20002300093. The next prime is 20002300111. The reversal of 20002300101 is 10100320002.
It is a happy number.
It is not a de Polignac number, because 20002300101 - 23 = 20002300093 is a prime.
It is a super-2 number, since 2×200023001012 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002300111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 158748351 + ... + 158748476.
It is an arithmetic number, because the mean of its divisors is an integer number (2751639176).
Almost surely, 220002300101 is an apocalyptic number.
20002300101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20002300101 is a deficient number, since it is larger than the sum of its proper divisors (13017370011).
20002300101 is a wasteful number, since it uses less digits than its factorization.
20002300101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317496840 (or 317496837 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 20002300101 its reverse (10100320002), we get a palindrome (30102620103).
The spelling of 20002300101 in words is "twenty billion, two million, three hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •