Base | Representation |
---|---|
bin | 10010101000001010… |
… | …001001010011010010 |
3 | 1220121220121012112220 |
4 | 102220022021103102 |
5 | 311430240213020 |
6 | 13104405001510 |
7 | 1305434360562 |
oct | 225012112322 |
9 | 56556535486 |
10 | 20001101010 |
11 | 8534111250 |
12 | 3a623b3296 |
13 | 1b699a1b17 |
14 | d7a4d0da2 |
15 | 7c0dd7240 |
hex | 4a82894d2 |
20001101010 has 64 divisors (see below), whose sum is σ = 52418202624. Its totient is φ = 4843966400.
The previous prime is 20001101009. The next prime is 20001101039. The reversal of 20001101010 is 1010110002.
It is a super-2 number, since 2×200011010102 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a self number, because there is not a number n which added to its sum of digits gives 20001101010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 310837 + ... + 369623.
It is an arithmetic number, because the mean of its divisors is an integer number (819034416).
Almost surely, 220001101010 is an apocalyptic number.
20001101010 is an abundant number, since it is smaller than the sum of its proper divisors (32417101614).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001101010 is a wasteful number, since it uses less digits than its factorization.
20001101010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59839.
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 20001101010 its reverse (1010110002), we get a palindrome (21011211012).
The spelling of 20001101010 in words is "twenty billion, one million, one hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •