Base | Representation |
---|---|
bin | 1001001101101101010101… |
… | …1010101100110100100110 |
3 | 1022212112011201021121200211 |
4 | 2103123111122230310212 |
5 | 2311442010014232220 |
6 | 33314100320530034 |
7 | 2063643302202205 |
oct | 223332532546446 |
9 | 38775151247624 |
10 | 10131113430310 |
11 | 3256643460894 |
12 | 117758948091a |
13 | 58648a903a52 |
14 | 2704c443123c |
15 | 1288008e1b5a |
hex | 936d56acd26 |
10131113430310 has 16 divisors (see below), whose sum is σ = 18242418578256. Its totient is φ = 4051019949088.
The previous prime is 10131113430173. The next prime is 10131113430313. The reversal of 10131113430310 is 1303431113101.
It is a super-2 number, since 2×101311134303102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131113430313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 178148029 + ... + 178204888.
It is an arithmetic number, because the mean of its divisors is an integer number (1140151161141).
Almost surely, 210131113430310 is an apocalyptic number.
10131113430310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10131113430310 is a deficient number, since it is larger than the sum of its proper divisors (8111305147946).
10131113430310 is a wasteful number, since it uses less digits than its factorization.
10131113430310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 356355767.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 10131113430310 its reverse (1303431113101), we get a palindrome (11434544543411).
The spelling of 10131113430310 in words is "ten trillion, one hundred thirty-one billion, one hundred thirteen million, four hundred thirty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •