Base | Representation |
---|---|
bin | 10110110000101111… |
… | …01001000111111001 |
3 | 1011112122002212201001 |
4 | 23120113221013321 |
5 | 200011310323001 |
6 | 5340325125001 |
7 | 611552244142 |
oct | 133027510771 |
9 | 34478085631 |
10 | 12220011001 |
11 | 5200972150 |
12 | 2450559761 |
13 | 11c9907253 |
14 | 83cd2cac9 |
15 | 4b7c2e001 |
hex | 2d85e91f9 |
12220011001 has 8 divisors (see below), whose sum is σ = 13518681408. Its totient is φ = 10952634000.
The previous prime is 12220010977. The next prime is 12220011007. The reversal of 12220011001 is 10011002221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12220011001 - 211 = 12220008953 is a prime.
It is a super-2 number, since 2×122200110012 (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 (12220011007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7822530 + ... + 7824091.
It is an arithmetic number, because the mean of its divisors is an integer number (1689835176).
Almost surely, 212220011001 is an apocalyptic number.
12220011001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12220011001 is a deficient number, since it is larger than the sum of its proper divisors (1298670407).
12220011001 is a wasteful number, since it uses less digits than its factorization.
12220011001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15646703.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 12220011001 its reverse (10011002221), we get a palindrome (22231013222).
The spelling of 12220011001 in words is "twelve billion, two hundred twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •