Base | Representation |
---|---|
bin | 1001011001010110101110… |
… | …0100010100011111110011 |
3 | 1100120122122011101211120001 |
4 | 2112111223210110133303 |
5 | 2323231244430431011 |
6 | 33550031020330431 |
7 | 2114255535554242 |
oct | 226255344243763 |
9 | 40518564354501 |
10 | 10331201030131 |
11 | 332348a714033 |
12 | 11aa30a3a3a17 |
13 | 59c2c7114527 |
14 | 27a065dd6959 |
15 | 12db118bb7c1 |
hex | 9656b9147f3 |
10331201030131 has 32 divisors (see below), whose sum is σ = 10753546383360. Its totient is φ = 9917356176000.
The previous prime is 10331201030041. The next prime is 10331201030197. The reversal of 10331201030131 is 13103010213301.
It is a cyclic number.
It is not a de Polignac number, because 10331201030131 - 239 = 9781445216243 is a prime.
It is a super-2 number, since 2×103312010301312 (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 = 10331201030099 and 10331201030108.
It is not an unprimeable number, because it can be changed into a prime (10331201031131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1679593906 + ... + 1679600056.
It is an arithmetic number, because the mean of its divisors is an integer number (336048324480).
Almost surely, 210331201030131 is an apocalyptic number.
10331201030131 is a deficient number, since it is larger than the sum of its proper divisors (422345353229).
10331201030131 is a wasteful number, since it uses less digits than its factorization.
10331201030131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8275.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 10331201030131 its reverse (13103010213301), we get a palindrome (23434211243432).
The spelling of 10331201030131 in words is "ten trillion, three hundred thirty-one billion, two hundred one million, thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •