Base | Representation |
---|---|
bin | 1100111011011000110… |
… | …0101001001110100001 |
3 | 210020021112112002100200 |
4 | 3032312030221032201 |
5 | 12114330111200001 |
6 | 250010435535413 |
7 | 22021563462303 |
oct | 3166614511641 |
9 | 706245462320 |
10 | 222100100001 |
11 | 8621279745a |
12 | 37064a5a569 |
13 | 17c36b1b320 |
14 | aa6d27b973 |
15 | 5b9d777086 |
hex | 33b63293a1 |
222100100001 has 48 divisors (see below), whose sum is σ = 360948806400. Its totient is φ = 130575494016.
The previous prime is 222100099957. The next prime is 222100100003. The reversal of 222100100001 is 100001001222.
222100100001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 222100100001 - 27 = 222100099873 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (222100100003) 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 47 ways as a sum of consecutive naturals, for example, 2181060 + ... + 2280618.
It is an arithmetic number, because the mean of its divisors is an integer number (7519766800).
Almost surely, 2222100100001 is an apocalyptic number.
It is an amenable number.
222100100001 is a deficient number, since it is larger than the sum of its proper divisors (138848706399).
222100100001 is a wasteful number, since it uses less digits than its factorization.
222100100001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100430 (or 100427 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 222100100001 its reverse (100001001222), we get a palindrome (322101101223).
The spelling of 222100100001 in words is "two hundred twenty-two billion, one hundred million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •