Base | Representation |
---|---|
bin | 111100111011000… |
… | …101100000010000 |
3 | 2122020022011210101 |
4 | 330323011200100 |
5 | 4043130401000 |
6 | 245231342144 |
7 | 34220615344 |
oct | 7473054020 |
9 | 2566264711 |
10 | 1022122000 |
11 | 484a63429 |
12 | 246381954 |
13 | 1339b4423 |
14 | 99a69624 |
15 | 5eb00e6a |
hex | 3cec5810 |
1022122000 has 40 divisors (see below), whose sum is σ = 2471495832. Its totient is φ = 408848000.
The previous prime is 1022121977. The next prime is 1022122021. The reversal of 1022122000 is 2212201.
It can be written as a sum of positive squares in 4 ways, for example, as 330221584 + 691900416 = 18172^2 + 26304^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 253531 + ... + 257530.
Almost surely, 21022122000 is an apocalyptic number.
1022122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022122000 is an abundant number, since it is smaller than the sum of its proper divisors (1449373832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022122000 is an equidigital number, since it uses as much as digits as its factorization.
1022122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 511084 (or 511068 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
The square root of 1022122000 is about 31970.6427836539. The cubic root of 1022122000 is about 1007.3202827049.
Adding to 1022122000 its reverse (2212201), we get a palindrome (1024334201).
The spelling of 1022122000 in words is "one billion, twenty-two million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •