Base | Representation |
---|---|
bin | 10010110100101110… |
… | …101010010100001011 |
3 | 1221011121102222121000 |
4 | 102310232222110023 |
5 | 312343233000021 |
6 | 13141341150043 |
7 | 1313605110510 |
oct | 226456522413 |
9 | 57147388530 |
10 | 20212000011 |
11 | 8632168845 |
12 | 3b00b5b323 |
13 | 1ba15a3c28 |
14 | d9a50d307 |
15 | 7d4695b26 |
hex | 4b4baa50b |
20212000011 has 32 divisors (see below), whose sum is σ = 34238131200. Its totient is φ = 11544059520.
The previous prime is 20212000001. The next prime is 20212000013. The reversal of 20212000011 is 11000021202.
It is not a de Polignac number, because 20212000011 - 27 = 20211999883 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20211999957 and 20212000002.
It is not an unprimeable number, because it can be changed into a prime (20212000013) 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 31 ways as a sum of consecutive naturals, for example, 377266 + ... + 427496.
It is an arithmetic number, because the mean of its divisors is an integer number (1069941600).
Almost surely, 220212000011 is an apocalyptic number.
20212000011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20212000011 is a deficient number, since it is larger than the sum of its proper divisors (14026131189).
20212000011 is a wasteful number, since it uses less digits than its factorization.
20212000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52376 (or 52370 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20212000011 its reverse (11000021202), we get a palindrome (31212021213).
The spelling of 20212000011 in words is "twenty billion, two hundred twelve million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •