Base | Representation |
---|---|
bin | 1001010001110101110111… |
… | …0111010110111111110000 |
3 | 1100010022110102122212100021 |
4 | 2110131131313112333300 |
5 | 2314122421230334300 |
6 | 33410442403333224 |
7 | 2102036045130502 |
oct | 224353567267760 |
9 | 40108412585307 |
10 | 10202122121200 |
11 | 3283771a72299 |
12 | 11892a6081214 |
13 | 59009600c2c9 |
14 | 273adcdb7d72 |
15 | 12a5a984dd1a |
hex | 9475ddd6ff0 |
10202122121200 has 30 divisors (see below), whose sum is σ = 24510598397144. Its totient is φ = 4080848848320.
The previous prime is 10202122121179. The next prime is 10202122121239. The reversal of 10202122121200 is 212122120201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 12752652252 + ... + 12752653051.
Almost surely, 210202122121200 is an apocalyptic number.
10202122121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10202122121200 is an abundant number, since it is smaller than the sum of its proper divisors (14308476275944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10202122121200 is a wasteful number, since it uses less digits than its factorization.
10202122121200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25505305321 (or 25505305310 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 10202122121200 its reverse (212122120201), we get a palindrome (10414244241401).
Subtracting from 10202122121200 its reverse (212122120201), we obtain a palindrome (9990000000999).
The spelling of 10202122121200 in words is "ten trillion, two hundred two billion, one hundred twenty-two million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •