Base | Representation |
---|---|
bin | 1100111011001000000… |
… | …1100111011000100001 |
3 | 210020002122210201102002 |
4 | 3032302001213120201 |
5 | 12114204201200001 |
6 | 245555455333345 |
7 | 22020053465543 |
oct | 3166201473041 |
9 | 706078721362 |
10 | 222030100001 |
11 | 86187226416 |
12 | 37045521255 |
13 | 17c2547c7c8 |
14 | aa63c59693 |
15 | 5b9754b46b |
hex | 33b2067621 |
222030100001 has 8 divisors (see below), whose sum is σ = 222659877024. Its totient is φ = 221401158880.
The previous prime is 222030099983. The next prime is 222030100049. The reversal of 222030100001 is 100001030222.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-222030100001 is a prime.
It is a super-3 number, since 3×2220301000013 (a number of 35 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (222030400001) 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 7 ways as a sum of consecutive naturals, for example, 324941 + ... + 741381.
It is an arithmetic number, because the mean of its divisors is an integer number (27832484628).
Almost surely, 2222030100001 is an apocalyptic number.
It is an amenable number.
222030100001 is a deficient number, since it is larger than the sum of its proper divisors (629777023).
222030100001 is an equidigital number, since it uses as much as digits as its factorization.
222030100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417951.
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 222030100001 its reverse (100001030222), we get a palindrome (322031130223).
The spelling of 222030100001 in words is "two hundred twenty-two billion, thirty million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •