Base | Representation |
---|---|
bin | 10111011011010011010010… |
… | …001001000111100100010100 |
3 | 111111210200112112222000102220 |
4 | 113123103102021013210110 |
5 | 102001030344440231400 |
6 | 1003043514054102340 |
7 | 30462521132323515 |
oct | 2733232211074424 |
9 | 444720475860386 |
10 | 103031201102100 |
11 | 2a913318005747 |
12 | b68017894a9b0 |
13 | 4564a53b29c2b |
14 | 1b62a4588ca0c |
15 | bda1282e47a0 |
hex | 5db4d2247914 |
103031201102100 has 72 divisors (see below), whose sum is σ = 298306263510528. Its totient is φ = 27456309081600.
The previous prime is 103031201102099. The next prime is 103031201102111. The reversal of 103031201102100 is 1201102130301.
It is a happy number.
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 103031201102100.
It is a congruent number.
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, 116294709 + ... + 117177308.
Almost surely, 2103031201102100 is an apocalyptic number.
103031201102100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103031201102100 is an abundant number, since it is smaller than the sum of its proper divisors (195275062408428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103031201102100 is a wasteful number, since it uses less digits than its factorization.
103031201102100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233473505 (or 233473498 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 103031201102100 its reverse (1201102130301), we get a palindrome (104232303232401).
The spelling of 103031201102100 in words is "one hundred three trillion, thirty-one billion, two hundred one million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •