Base | Representation |
---|---|
bin | 110000000001100001… |
… | …0011111111110010000 |
3 | 100212012022200002011010 |
4 | 1200003002133332100 |
5 | 3142202312431000 |
6 | 115213302050520 |
7 | 10310443152600 |
oct | 1400302377620 |
9 | 325168602133 |
10 | 103130202000 |
11 | 3a812346201 |
12 | 17ba2119a40 |
13 | 9957180687 |
14 | 4dc4a7ac00 |
15 | 2a38e4bd50 |
hex | 180309ff90 |
103130202000 has 240 divisors, whose sum is σ = 386777244672. Its totient is φ = 23572550400.
The previous prime is 103130201987. The next prime is 103130202037. The reversal of 103130202000 is 202031301.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 118609 + ... + 469391.
Almost surely, 2103130202000 is an apocalyptic number.
103130202000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 103130202000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193388622336).
103130202000 is an abundant number, since it is smaller than the sum of its proper divisors (283647042672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103130202000 is a wasteful number, since it uses less digits than its factorization.
103130202000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 350823 (or 350800 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 103130202000 its reverse (202031301), we get a palindrome (103332233301).
The spelling of 103130202000 in words is "one hundred three billion, one hundred thirty million, two hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •