Base | Representation |
---|---|
bin | 1001001000111111101001… |
… | …1111101011000100001000 |
3 | 1022120210010220202121120122 |
4 | 2102033322133223010020 |
5 | 2304130132031042300 |
6 | 33212544432442412 |
7 | 2055045421642334 |
oct | 222177237530410 |
9 | 38523126677518 |
10 | 10050131112200 |
11 | 3225267008663 |
12 | 11639486a9408 |
13 | 57b95311301a |
14 | 26a60102c7c4 |
15 | 126661085c85 |
hex | 923fa7eb108 |
10050131112200 has 24 divisors (see below), whose sum is σ = 23366554836330. Its totient is φ = 4020052444800.
The previous prime is 10050131112149. The next prime is 10050131112211. The reversal of 10050131112200 is 221113105001.
10050131112200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 5391414651364 + 4658716460836 = 2321942^2 + 2158406^2 .
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, 25125327581 + ... + 25125327980.
Almost surely, 210050131112200 is an apocalyptic number.
10050131112200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10050131112200 is an abundant number, since it is smaller than the sum of its proper divisors (13316423724130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10050131112200 is a wasteful number, since it uses less digits than its factorization.
10050131112200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50250655577 (or 50250655568 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 17.
Adding to 10050131112200 its reverse (221113105001), we get a palindrome (10271244217201).
The spelling of 10050131112200 in words is "ten trillion, fifty billion, one hundred thirty-one million, one hundred twelve thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •