Base | Representation |
---|---|
bin | 1001011000001000000111… |
… | …1010100110011101000000 |
3 | 1100111122011200020000020222 |
4 | 2112002001322212131000 |
5 | 2322410041342224440 |
6 | 33532221200322212 |
7 | 2112610626443435 |
oct | 226020172463500 |
9 | 40448150200228 |
10 | 10310101133120 |
11 | 3315542340118 |
12 | 11a6200013368 |
13 | 59a3138c3a79 |
14 | 2790239dbb8c |
15 | 12d2c92da2b5 |
hex | 96081ea6740 |
10310101133120 has 112 divisors (see below), whose sum is σ = 25663691827200. Its totient is φ = 3940487516160.
The previous prime is 10310101133119. The next prime is 10310101133161. The reversal of 10310101133120 is 2133110101301.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5794325 + ... + 7361684.
It is an arithmetic number, because the mean of its divisors is an integer number (229140105600).
Almost surely, 210310101133120 is an apocalyptic number.
10310101133120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10310101133120 is an abundant number, since it is smaller than the sum of its proper divisors (15353590694080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10310101133120 is a wasteful number, since it uses less digits than its factorization.
10310101133120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13156136 (or 13156126 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 10310101133120 its reverse (2133110101301), we get a palindrome (12443211234421).
The spelling of 10310101133120 in words is "ten trillion, three hundred ten billion, one hundred one million, one hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •