Base | Representation |
---|---|
bin | 1001001100000101010110… |
… | …1001111011000010110100 |
3 | 1022202212010101111012200122 |
4 | 2103001111221323002310 |
5 | 2311012323213231200 |
6 | 33253202430031112 |
7 | 2061634501116431 |
oct | 223012551730264 |
9 | 38685111435618 |
10 | 10103200133300 |
11 | 324581a0a368a |
12 | 1172099348498 |
13 | 58395c952361 |
14 | 26cdd71b0b88 |
15 | 127c1a0a5385 |
hex | 93055a7b0b4 |
10103200133300 has 36 divisors (see below), whose sum is σ = 21924741750156. Its totient is φ = 4041133056000.
The previous prime is 10103200133263. The next prime is 10103200133311. The reversal of 10103200133300 is 333100230101.
It can be written as a sum of positive squares in 6 ways, for example, as 107966130724 + 9995234002576 = 328582^2 + 3161524^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 946484 + ... + 4593716.
It is an arithmetic number, because the mean of its divisors is an integer number (609020604171).
Almost surely, 210103200133300 is an apocalyptic number.
10103200133300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10103200133300 is an abundant number, since it is smaller than the sum of its proper divisors (11821541616856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10103200133300 is a wasteful number, since it uses less digits than its factorization.
10103200133300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3674948 (or 3674941 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 10103200133300 its reverse (333100230101), we get a palindrome (10436300363401).
The spelling of 10103200133300 in words is "ten trillion, one hundred three billion, two hundred million, one hundred thirty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •