Base | Representation |
---|---|
bin | 1000010001110101… |
… | …1001101101100001 |
3 | 12201212122112111110 |
4 | 2010131121231201 |
5 | 14022402100001 |
6 | 1004303333533 |
7 | 106033144515 |
oct | 20435315541 |
9 | 5655575443 |
10 | 2222300001 |
11 | a40480979 |
12 | 5202b12a9 |
13 | 29553b91c |
14 | 171204145 |
15 | d01743d6 |
hex | 84759b61 |
2222300001 has 8 divisors (see below), whose sum is σ = 2970531904. Its totient is φ = 1477800720.
The previous prime is 2222299991. The next prime is 2222300051. The reversal of 2222300001 is 1000032222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2222300001 - 25 = 2222299969 is a prime.
It is a super-5 number, since 5×22223000015 (a number of 48 digits) contains 55555 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2222300001.
It is not an unprimeable number, because it can be changed into a prime (2222300051) 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, 931765 + ... + 934146.
It is an arithmetic number, because the mean of its divisors is an integer number (371316488).
Almost surely, 22222300001 is an apocalyptic number.
It is an amenable number.
2222300001 is a deficient number, since it is larger than the sum of its proper divisors (748231903).
2222300001 is a wasteful number, since it uses less digits than its factorization.
2222300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1866311.
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 2222300001 is about 47141.2770404027. The cubic root of 2222300001 is about 1304.9711048930.
Adding to 2222300001 its reverse (1000032222), we get a palindrome (3222332223).
The spelling of 2222300001 in words is "two billion, two hundred twenty-two million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •