Base | Representation |
---|---|
bin | 1001010010010011101000… |
… | …1010101000111010010011 |
3 | 1100011002002100011011211000 |
4 | 2110210322022220322103 |
5 | 2314240302430131011 |
6 | 33414243342353043 |
7 | 2102441056442565 |
oct | 224447212507223 |
9 | 40132070134730 |
10 | 10210113130131 |
11 | 32870a2759602 |
12 | 118a95628b783 |
13 | 590a6a724b65 |
14 | 27425a3c1335 |
15 | 12a8c6170356 |
hex | 9493a2a8e93 |
10210113130131 has 16 divisors (see below), whose sum is σ = 15130869811200. Its totient is φ = 6804592758504.
The previous prime is 10210113130121. The next prime is 10210113130169. The reversal of 10210113130131 is 13103131101201.
10210113130131 is a `hidden beast` number, since 1 + 0 + 210 + 11 + 313 + 0 + 131 = 666.
It is not a de Polignac number, because 10210113130131 - 223 = 10210104741523 is a prime.
It is a super-2 number, since 2×102101131301312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10210113130121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59616471 + ... + 59787488.
It is an arithmetic number, because the mean of its divisors is an integer number (945679363200).
Almost surely, 210210113130131 is an apocalyptic number.
10210113130131 is a deficient number, since it is larger than the sum of its proper divisors (4920756681069).
10210113130131 is a wasteful number, since it uses less digits than its factorization.
10210113130131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119407135 (or 119407129 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 10210113130131 its reverse (13103131101201), we get a palindrome (23313244231332).
The spelling of 10210113130131 in words is "ten trillion, two hundred ten billion, one hundred thirteen million, one hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •