Base | Representation |
---|---|
bin | 1001001101101101010101… |
… | …1110000001111101001110 |
3 | 1022212112011202220222020011 |
4 | 2103123111132001331032 |
5 | 2311442010230201220 |
6 | 33314100351343434 |
7 | 2063643312466330 |
oct | 223332536017516 |
9 | 38775152828204 |
10 | 10131114303310 |
11 | 32566439a7780 |
12 | 1177589821b7a |
13 | 58648ab4b210 |
14 | 2704c45bb450 |
15 | 128800a1565a |
hex | 936d5781f4e |
10131114303310 has 256 divisors, whose sum is σ = 24598605201408. Its totient is φ = 2901319948800.
The previous prime is 10131114303307. The next prime is 10131114303371. The reversal of 10131114303310 is 1330341113101.
It is a super-3 number, since 3×101311143033103 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2097102595 + ... + 2097107425.
It is an arithmetic number, because the mean of its divisors is an integer number (96088301568).
Almost surely, 210131114303310 is an apocalyptic number.
10131114303310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10131114303310 is an abundant number, since it is smaller than the sum of its proper divisors (14467490898098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131114303310 is a wasteful number, since it uses less digits than its factorization.
10131114303310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5799.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10131114303310 its reverse (1330341113101), we get a palindrome (11461455416411).
The spelling of 10131114303310 in words is "ten trillion, one hundred thirty-one billion, one hundred fourteen million, three hundred three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •