Base | Representation |
---|---|
bin | 1001010010111000110110… |
… | …0100010110000010100100 |
3 | 1100012000212111120012101120 |
4 | 2110232031210112002210 |
5 | 2314421232142441400 |
6 | 33423014501253540 |
7 | 2103243443210232 |
oct | 224561544260244 |
9 | 40160774505346 |
10 | 10220102312100 |
11 | 329035935489a |
12 | 11908837042b0 |
13 | 5919a00c5315 |
14 | 274926d29952 |
15 | 12acad0e2ca0 |
hex | 94b8d9160a4 |
10220102312100 has 72 divisors (see below), whose sum is σ = 30291386206368. Its totient is φ = 2658888403200.
The previous prime is 10220102312089. The next prime is 10220102312107. The reversal of 10220102312100 is 121320102201.
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 10220102312100.
It is not an unprimeable number, because it can be changed into a prime (10220102312107) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 415439014 + ... + 415463613.
Almost surely, 210220102312100 is an apocalyptic number.
10220102312100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10220102312100 is an abundant number, since it is smaller than the sum of its proper divisors (20071283894268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10220102312100 is a wasteful number, since it uses less digits than its factorization.
10220102312100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 830902685 (or 830902678 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10220102312100 its reverse (121320102201), we get a palindrome (10341422414301).
The spelling of 10220102312100 in words is "ten trillion, two hundred twenty billion, one hundred two million, three hundred twelve thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •