Base | Representation |
---|---|
bin | 11101101111110101000… |
… | …01000001011111010010 |
3 | 10121201020121200110122210 |
4 | 32313322201001133102 |
5 | 113221240203210002 |
6 | 2101315001012550 |
7 | 133562562302460 |
oct | 16677241013722 |
9 | 3551217613583 |
10 | 1022110210002 |
11 | 364524626a22 |
12 | 146112784156 |
13 | 754ccbc763b |
14 | 37682ab5830 |
15 | 1b8c28b496c |
hex | edfa8417d2 |
1022110210002 has 64 divisors (see below), whose sum is σ = 2375807652864. Its totient is φ = 287092088640.
The previous prime is 1022110209943. The next prime is 1022110210003. The reversal of 1022110210002 is 2000120112201.
It is a self number, because there is not a number n which added to its sum of digits gives 1022110210002.
It is not an unprimeable number, because it can be changed into a prime (1022110210003) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4781133 + ... + 4990335.
It is an arithmetic number, because the mean of its divisors is an integer number (37121994576).
Almost surely, 21022110210002 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1022110210002, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1187903826432).
1022110210002 is an abundant number, since it is smaller than the sum of its proper divisors (1353697442862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022110210002 is a wasteful number, since it uses less digits than its factorization.
1022110210002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211183.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1022110210002 its reverse (2000120112201), we get a palindrome (3022230322203).
The spelling of 1022110210002 in words is "one trillion, twenty-two billion, one hundred ten million, two hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •