Base | Representation |
---|---|
bin | 10010101110000111… |
… | …001110110000010101 |
3 | 1220212212120121111101 |
4 | 102232013032300111 |
5 | 312131324001323 |
6 | 13122334110101 |
7 | 1311056453110 |
oct | 225607166025 |
9 | 56785517441 |
10 | 20101000213 |
11 | 8585543a78 |
12 | 3a8b94b331 |
13 | 1b845ab788 |
14 | d89897577 |
15 | 7c9a6bdad |
hex | 4ae1cec15 |
20101000213 has 16 divisors (see below), whose sum is σ = 24035717376. Its totient is φ = 16436090880.
The previous prime is 20101000207. The next prime is 20101000223. The reversal of 20101000213 is 31200010102.
It is a cyclic number.
It is not a de Polignac number, because 20101000213 - 29 = 20100999701 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20101000213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20101000223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107308 + ... + 227413.
It is an arithmetic number, because the mean of its divisors is an integer number (1502232336).
Almost surely, 220101000213 is an apocalyptic number.
20101000213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
20101000213 is a deficient number, since it is larger than the sum of its proper divisors (3934717163).
20101000213 is a wasteful number, since it uses less digits than its factorization.
20101000213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335124.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 20101000213 its reverse (31200010102), we get a palindrome (51301010315).
The spelling of 20101000213 in words is "twenty billion, one hundred one million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •