Base | Representation |
---|---|
bin | 10001011111100100000… |
… | …011111001010110111000 |
3 | 11020220212221211001221020 |
4 | 101133210003321112320 |
5 | 124143421224232300 |
6 | 2320125224342440 |
7 | 152564464162635 |
oct | 21374403712670 |
9 | 4226787731836 |
10 | 1202122102200 |
11 | 4238a9650968 |
12 | 174b90314a20 |
13 | 8948a143a96 |
14 | 4227c2c918c |
15 | 2140b16b8a0 |
hex | 117e40f95b8 |
1202122102200 has 96 divisors (see below), whose sum is σ = 3726746852400. Its totient is φ = 320551413760.
The previous prime is 1202122102163. The next prime is 1202122102201. The reversal of 1202122102200 is 22012212021.
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 1202122102200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1202122102201) 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, 23139454 + ... + 23191346.
Almost surely, 21202122102200 is an apocalyptic number.
1202122102200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1202122102200 is an abundant number, since it is smaller than the sum of its proper divisors (2524624750200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1202122102200 is a wasteful number, since it uses less digits than its factorization.
1202122102200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90521 (or 90512 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1202122102200 its reverse (22012212021), we get a palindrome (1224134314221).
The spelling of 1202122102200 in words is "one trillion, two hundred two billion, one hundred twenty-two million, one hundred two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •