Base | Representation |
---|---|
bin | 10111011100101111011010… |
… | …110000111101000010111100 |
3 | 111112011010220002011020221221 |
4 | 113130233122300331002330 |
5 | 102004141001240312200 |
6 | 1003201154440003124 |
7 | 30502622522216431 |
oct | 2734573260750274 |
9 | 445133802136857 |
10 | 103130130010300 |
11 | 2a951273880708 |
12 | b697387a604a4 |
13 | 457118b76aa33 |
14 | 1b6774c577b88 |
15 | bdc9b84a891a |
hex | 5dcbdac3d0bc |
103130130010300 has 72 divisors (see below), whose sum is σ = 247259102592096. Its totient is φ = 37137397186560.
The previous prime is 103130130010247. The next prime is 103130130010301. The reversal of 103130130010300 is 3010031031301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103130130010301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1318760517 + ... + 1318838716.
It is an arithmetic number, because the mean of its divisors is an integer number (3434154202668).
Almost surely, 2103130130010300 is an apocalyptic number.
103130130010300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103130130010300 is an abundant number, since it is smaller than the sum of its proper divisors (144128972581796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103130130010300 is a wasteful number, since it uses less digits than its factorization.
103130130010300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2637599287 (or 2637599280 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 16.
Adding to 103130130010300 its reverse (3010031031301), we get a palindrome (106140161041601).
The spelling of 103130130010300 in words is "one hundred three trillion, one hundred thirty billion, one hundred thirty million, ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •