Base | Representation |
---|---|
bin | 11101110010011110100011… |
… | …011110001100100110001011 |
3 | 122011212122012121020011222201 |
4 | 131302132203132030212023 |
5 | 114133000320242011021 |
6 | 1142350050333101031 |
7 | 36411212500060354 |
oct | 3562364336144613 |
9 | 564778177204881 |
10 | 131012130032011 |
11 | 38820a28a18768 |
12 | 1283b041327777 |
13 | 5814510912757 |
14 | 244d0415d0d2b |
15 | 1022dd5bb8591 |
hex | 7727a378c98b |
131012130032011 has 8 divisors (see below), whose sum is σ = 131023856384000. Its totient is φ = 131000404182120.
The previous prime is 131012130032009. The next prime is 131012130032041. The reversal of 131012130032011 is 110230031210131.
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 131012130032011 - 21 = 131012130032009 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 131012130032011.
It is not an unprimeable number, because it can be changed into a prime (131012130032041) 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, 674809210 + ... + 675003328.
It is an arithmetic number, because the mean of its divisors is an integer number (16377982048000).
Almost surely, 2131012130032011 is an apocalyptic number.
131012130032011 is a deficient number, since it is larger than the sum of its proper divisors (11726351989).
131012130032011 is a wasteful number, since it uses less digits than its factorization.
131012130032011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 251049.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 131012130032011 its reverse (110230031210131), we get a palindrome (241242161242142).
The spelling of 131012130032011 in words is "one hundred thirty-one trillion, twelve billion, one hundred thirty million, thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •