Base | Representation |
---|---|
bin | 10110110000110111… |
… | …10010111111100001 |
3 | 1011112201011012112101 |
4 | 23120123302333201 |
5 | 200012100200001 |
6 | 5340404330401 |
7 | 611564431105 |
oct | 133033627741 |
9 | 34481135471 |
10 | 12221100001 |
11 | 5201546350 |
12 | 24509a3a01 |
13 | 11c9bc8b26 |
14 | 83d133905 |
15 | 4b7d96a01 |
hex | 2d86f2fe1 |
12221100001 has 4 divisors (see below), whose sum is σ = 13332109104. Its totient is φ = 11110090900.
The previous prime is 12221099983. The next prime is 12221100007. The reversal of 12221100001 is 10000112221.
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 not a de Polignac number, because 12221100001 - 29 = 12221099489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12221100007) 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, 555504535 + ... + 555504556.
It is an arithmetic number, because the mean of its divisors is an integer number (3333027276).
Almost surely, 212221100001 is an apocalyptic number.
12221100001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12221100001 is a deficient number, since it is larger than the sum of its proper divisors (1111009103).
12221100001 is a wasteful number, since it uses less digits than its factorization.
12221100001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1111009102.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 12221100001 its reverse (10000112221), we get a palindrome (22221212222).
It can be divided in two parts, 12221 and 100001, that multiplied together give a palindrome (1222112221).
The spelling of 12221100001 in words is "twelve billion, two hundred twenty-one million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •