Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …10000111001100110001 |
3 | 10112121011201211201000022 |
4 | 32203110222013030301 |
5 | 112341000024101001 |
6 | 2043221015133225 |
7 | 132150636432164 |
oct | 16432452071461 |
9 | 3477151751008 |
10 | 1000000222001 |
11 | 356109067770 |
12 | 141982074215 |
13 | 733b83458c1 |
14 | 365864a3adb |
15 | 1b02b7ac11b |
hex | e8d4a87331 |
1000000222001 has 32 divisors (see below), whose sum is σ = 1120945392000. Its totient is φ = 884381921280.
The previous prime is 1000000221991. The next prime is 1000000222003. The reversal of 1000000222001 is 1002220000001.
It is not a de Polignac number, because 1000000222001 - 230 = 998926480177 is a prime.
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 1000000222001.
It is not an unprimeable number, because it can be changed into a prime (1000000222003) 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 31 ways as a sum of consecutive naturals, for example, 36406865 + ... + 36434321.
It is an arithmetic number, because the mean of its divisors is an integer number (35029543500).
Almost surely, 21000000222001 is an apocalyptic number.
1000000222001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1000000222001 is a deficient number, since it is larger than the sum of its proper divisors (120945169999).
1000000222001 is a wasteful number, since it uses less digits than its factorization.
1000000222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28049.
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 1000000222001 its reverse (1002220000001), we get a palindrome (2002220222002).
The spelling of 1000000222001 in words is "one trillion, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •