Base | Representation |
---|---|
bin | 1001001101101001101001… |
… | …0000111111111010000100 |
3 | 1022212102121112220112011221 |
4 | 2103122122100333322010 |
5 | 2311432441441000200 |
6 | 33313414030210124 |
7 | 2063606562016504 |
oct | 223323220777204 |
9 | 38772545815157 |
10 | 10130121031300 |
11 | 3256184259816 |
12 | 1177351053944 |
13 | 5863601284ba |
14 | 27042c701a04 |
15 | 12879371291a |
hex | 9369a43fe84 |
10130121031300 has 36 divisors (see below), whose sum is σ = 22576480555300. Its totient is φ = 3942533589120.
The previous prime is 10130121031253. The next prime is 10130121031319. The reversal of 10130121031300 is 313012103101.
10130121031300 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 325118916864 + 9805002114436 = 570192^2 + 3131294^2 .
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, 1368931575 + ... + 1368938974.
Almost surely, 210130121031300 is an apocalyptic number.
10130121031300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10130121031300 is an abundant number, since it is smaller than the sum of its proper divisors (12446359524000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10130121031300 is a wasteful number, since it uses less digits than its factorization.
10130121031300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2737870600 (or 2737870593 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 10130121031300 its reverse (313012103101), we get a palindrome (10443133134401).
The spelling of 10130121031300 in words is "ten trillion, one hundred thirty billion, one hundred twenty-one million, thirty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •