Base | Representation |
---|---|
bin | 111100111010101… |
… | …101000101110001 |
3 | 2122020010002121201 |
4 | 330322231011301 |
5 | 4043114201001 |
6 | 245225251201 |
7 | 34220020660 |
oct | 7472550561 |
9 | 2566102551 |
10 | 1022022001 |
11 | 4849a5290 |
12 | 246333b01 |
13 | 13397aa60 |
14 | 99a40dd7 |
15 | 5ead1501 |
hex | 3cead171 |
1022022001 has 16 divisors (see below), whose sum is σ = 1372226688. Its totient is φ = 735120000.
The previous prime is 1022021993. The next prime is 1022022017. The reversal of 1022022001 is 1002202201.
It is a cyclic number.
It is not a de Polignac number, because 1022022001 - 23 = 1022021993 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1022022061) 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 15 ways as a sum of consecutive naturals, for example, 509500 + ... + 511501.
It is an arithmetic number, because the mean of its divisors is an integer number (85764168).
Almost surely, 21022022001 is an apocalyptic number.
1022022001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1022022001 is a deficient number, since it is larger than the sum of its proper divisors (350204687).
1022022001 is a wasteful number, since it uses less digits than its factorization.
1022022001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1021032.
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 1022022001 is about 31969.0788262659. The cubic root of 1022022001 is about 1007.2874313408.
Adding to 1022022001 its reverse (1002202201), we get a palindrome (2024224202).
It can be divided in two parts, 102202200 and 1, that added together give a palindrome (102202201).
The spelling of 1022022001 in words is "one billion, twenty-two million, twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •