Base | Representation |
---|---|
bin | 1100111011100000001… |
… | …0100001001011000001 |
3 | 210020100200122222012010 |
4 | 3032320002201023001 |
5 | 12114411014000001 |
6 | 250013502123133 |
7 | 22022420226621 |
oct | 3167002411301 |
9 | 706320588163 |
10 | 222131000001 |
11 | 86229182049 |
12 | 370732804a9 |
13 | 17c40349b51 |
14 | aa73402881 |
15 | 5ba132c8d6 |
hex | 33b80a12c1 |
222131000001 has 8 divisors (see below), whose sum is σ = 296210857984. Its totient is φ = 148069237680.
The previous prime is 222130999991. The next prime is 222131000011. The reversal of 222131000001 is 100000131222.
It is an interprime number because it is at equal distance from previous prime (222130999991) and next prime (222131000011).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 222131000001 - 210 = 222130998977 is a prime.
It is a super-2 number, since 2×2221310000012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222131000011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4495246 + ... + 4544391.
It is an arithmetic number, because the mean of its divisors is an integer number (37026357248).
Almost surely, 2222131000001 is an apocalyptic number.
It is an amenable number.
222131000001 is a deficient number, since it is larger than the sum of its proper divisors (74079857983).
222131000001 is an equidigital number, since it uses as much as digits as its factorization.
222131000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9047831.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 222131000001 its reverse (100000131222), we get a palindrome (322131131223).
The spelling of 222131000001 in words is "two hundred twenty-two billion, one hundred thirty-one million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •