Base | Representation |
---|---|
bin | 1001001100000101010110… |
… | …1001100010011000101100 |
3 | 1022202212010101022002010220 |
4 | 2103001111221202120230 |
5 | 2311012323202013200 |
6 | 33253202423531340 |
7 | 2061634500216114 |
oct | 223012551423054 |
9 | 38685111262126 |
10 | 10103200032300 |
11 | 324581a034811 |
12 | 11720992b9b50 |
13 | 58395c9183ab |
14 | 26cdd7186044 |
15 | 127c1a0854a0 |
hex | 93055a6262c |
10103200032300 has 72 divisors (see below), whose sum is σ = 29232355790736. Its totient is φ = 2694147010560.
The previous prime is 10103200032281. The next prime is 10103200032383. The reversal of 10103200032300 is 323000230101.
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 10103200032300.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24162612 + ... + 24577188.
It is an arithmetic number, because the mean of its divisors is an integer number (406004941538).
Almost surely, 210103200032300 is an apocalyptic number.
10103200032300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10103200032300 is an abundant number, since it is smaller than the sum of its proper divisors (19129155758436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10103200032300 is a wasteful number, since it uses less digits than its factorization.
10103200032300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 495827 (or 495820 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 10103200032300 its reverse (323000230101), we get a palindrome (10426200262401).
The spelling of 10103200032300 in words is "ten trillion, one hundred three billion, two hundred million, thirty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •