Base | Representation |
---|---|
bin | 1001010111101010010111… |
… | …0010011001111111110011 |
3 | 1100110212112222012022222201 |
4 | 2111322211302121333303 |
5 | 2322242211413431011 |
6 | 33524420403444031 |
7 | 2112205651623436 |
oct | 225724562317763 |
9 | 40425488168881 |
10 | 10302113030131 |
11 | 331211325910a |
12 | 11a4750986617 |
13 | 59963c987b00 |
14 | 2788a6b4d81d |
15 | 12ceacd8ecc1 |
hex | 95ea5c99ff3 |
10302113030131 has 12 divisors (see below), whose sum is σ = 11158139421912. Its totient is φ = 9507429038016.
The previous prime is 10302113030051. The next prime is 10302113030189. The reversal of 10302113030131 is 13103031120301.
It is not a de Polignac number, because 10302113030131 - 27 = 10302113030003 is a prime.
It is a super-2 number, since 2×103021130301312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10302113030099 and 10302113030108.
It is not an unprimeable number, because it can be changed into a prime (10302113030191) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 6367041 + ... + 7819426.
It is an arithmetic number, because the mean of its divisors is an integer number (929844951826).
Almost surely, 210302113030131 is an apocalyptic number.
10302113030131 is a deficient number, since it is larger than the sum of its proper divisors (856026391781).
10302113030131 is a wasteful number, since it uses less digits than its factorization.
10302113030131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14190790 (or 14190777 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 10302113030131 its reverse (13103031120301), we get a palindrome (23405144150432).
The spelling of 10302113030131 in words is "ten trillion, three hundred two billion, one hundred thirteen million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •