Base | Representation |
---|---|
bin | 10010101111010000… |
… | …100000111000111001 |
3 | 1220221012201121202001 |
4 | 102233100200320321 |
5 | 312201233223001 |
6 | 13124301541001 |
7 | 1311411654202 |
oct | 225720407071 |
9 | 56835647661 |
10 | 20120211001 |
11 | 8595375360 |
12 | 3a96274761 |
13 | 1b885768c7 |
14 | d8c2585a9 |
15 | 7cb5b4001 |
hex | 4af420e39 |
20120211001 has 4 divisors (see below), whose sum is σ = 21949321104. Its totient is φ = 18291100900.
The previous prime is 20120210989. The next prime is 20120211031. The reversal of 20120211001 is 10011202102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20120211001 is a prime.
It is a super-2 number, since 2×201202110012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20120211031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 914555035 + ... + 914555056.
It is an arithmetic number, because the mean of its divisors is an integer number (5487330276).
Almost surely, 220120211001 is an apocalyptic number.
It is an amenable number.
20120211001 is a deficient number, since it is larger than the sum of its proper divisors (1829110103).
20120211001 is a wasteful number, since it uses less digits than its factorization.
20120211001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1829110102.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20120211001 its reverse (10011202102), we get a palindrome (30131413103).
It can be divided in two parts, 201 and 20211001, that added together give a palindrome (20211202).
The spelling of 20120211001 in words is "twenty billion, one hundred twenty million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •