Base | Representation |
---|---|
bin | 1001001101101101101010… |
… | …1001010000010111111111 |
3 | 1022212112101211022022211201 |
4 | 2103123122221100113333 |
5 | 2311442144442211111 |
6 | 33314113132400331 |
7 | 2063645415513310 |
oct | 223333251202777 |
9 | 38775354268751 |
10 | 10131201132031 |
11 | 3256688a12451 |
12 | 11775b29160a7 |
13 | 5864a2b2c865 |
14 | 2704d1d40607 |
15 | 1288084676c1 |
hex | 936daa505ff |
10131201132031 has 8 divisors (see below), whose sum is σ = 11581914055680. Its totient is φ = 8681337827448.
The previous prime is 10131201132001. The next prime is 10131201132071. The reversal of 10131201132031 is 13023110213101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10131201132031 - 219 = 10131200607743 is a prime.
It is a super-2 number, since 2×101312011320312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131201132001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 212379211 + ... + 212426908.
It is an arithmetic number, because the mean of its divisors is an integer number (1447739256960).
Almost surely, 210131201132031 is an apocalyptic number.
10131201132031 is a deficient number, since it is larger than the sum of its proper divisors (1450712923649).
10131201132031 is an equidigital number, since it uses as much as digits as its factorization.
10131201132031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424809533.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 10131201132031 its reverse (13023110213101), we get a palindrome (23154311345132).
The spelling of 10131201132031 in words is "ten trillion, one hundred thirty-one billion, two hundred one million, one hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •