Base | Representation |
---|---|
bin | 1001001100101010010001… |
… | …1000111010101110011000 |
3 | 1022210210201002112220220110 |
4 | 2103022210120322232120 |
5 | 2311143122404311300 |
6 | 33301522110324320 |
7 | 2062435214150322 |
oct | 223124430725630 |
9 | 38723632486813 |
10 | 10113111010200 |
11 | 3249a45576140 |
12 | 1173ba44b96a0 |
13 | 58487c036a63 |
14 | 26d697574612 |
15 | 1280ea20b550 |
hex | 932a463ab98 |
10113111010200 has 192 divisors, whose sum is σ = 35125046853120. Its totient is φ = 2385402048000.
The previous prime is 10113111010181. The next prime is 10113111010207. The reversal of 10113111010200 is 201011131101.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113111010207) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20462416 + ... + 20950815.
It is an arithmetic number, because the mean of its divisors is an integer number (182942952360).
Almost surely, 210113111010200 is an apocalyptic number.
10113111010200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10113111010200 is an abundant number, since it is smaller than the sum of its proper divisors (25011935842920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10113111010200 is a wasteful number, since it uses less digits than its factorization.
10113111010200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41413298 (or 41413289 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 10113111010200 its reverse (201011131101), we get a palindrome (10314122141301).
The spelling of 10113111010200 in words is "ten trillion, one hundred thirteen billion, one hundred eleven million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •