Base | Representation |
---|---|
bin | 100001011100011… |
… | …1001000011010001 |
3 | 2220012122011201101 |
4 | 1002320321003101 |
5 | 4244241210001 |
6 | 303204504401 |
7 | 36544425163 |
oct | 10270710321 |
9 | 2805564641 |
10 | 1122210001 |
11 | 526504a90 |
12 | 2739ab101 |
13 | 14b658cb3 |
14 | a9080933 |
15 | 687c1a01 |
hex | 42e390d1 |
1122210001 has 32 divisors (see below), whose sum is σ = 1346830848. Its totient is φ = 923408640.
The previous prime is 1122209971. The next prime is 1122210007. The reversal of 1122210001 is 1000122211.
It is not a de Polignac number, because 1122210001 - 29 = 1122209489 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1122210001.
It is not an unprimeable number, because it can be changed into a prime (1122210007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 537706 + ... + 539788.
It is an arithmetic number, because the mean of its divisors is an integer number (42088464).
Almost surely, 21122210001 is an apocalyptic number.
1122210001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1122210001 is a deficient number, since it is larger than the sum of its proper divisors (224620847).
1122210001 is a wasteful number, since it uses less digits than its factorization.
1122210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2221.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1122210001 is about 33499.4029946804. The cubic root of 1122210001 is about 1039.1814321320.
Adding to 1122210001 its reverse (1000122211), we get a palindrome (2122332212).
The spelling of 1122210001 in words is "one billion, one hundred twenty-two million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •