Base | Representation |
---|---|
bin | 11101101111110110011… |
… | …10110000110010010010 |
3 | 10121201021110020122010120 |
4 | 32313323032300302102 |
5 | 113221301240401320 |
6 | 2101320110011110 |
7 | 133563066231366 |
oct | 16677316606222 |
9 | 3551243218116 |
10 | 1022122200210 |
11 | 364530376391 |
12 | 1461167a6a96 |
13 | 75502535037 |
14 | 376845172a6 |
15 | 1b8c3982440 |
hex | edfb3b0c92 |
1022122200210 has 32 divisors (see below), whose sum is σ = 2519393101632. Its totient is φ = 265199273280.
The previous prime is 1022122200193. The next prime is 1022122200259. The reversal of 1022122200210 is 120022212201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1022122200210.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 460414296 + ... + 460416515.
It is an arithmetic number, because the mean of its divisors is an integer number (78731034426).
Almost surely, 21022122200210 is an apocalyptic number.
1022122200210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1022122200210 is an abundant number, since it is smaller than the sum of its proper divisors (1497270901422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022122200210 is a wasteful number, since it uses less digits than its factorization.
1022122200210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 920830858.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1022122200210 its reverse (120022212201), we get a palindrome (1142144412411).
The spelling of 1022122200210 in words is "one trillion, twenty-two billion, one hundred twenty-two million, two hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •