Base | Representation |
---|---|
bin | 11101110010010100010010… |
… | …101100010110011011110011 |
3 | 122011211120202200012000120100 |
4 | 131302110102230112123303 |
5 | 114132310233421031121 |
6 | 1142341025111243443 |
7 | 36410342440562412 |
oct | 3562242254263363 |
9 | 564746680160510 |
10 | 131001111111411 |
11 | 38817294037612 |
12 | 12838a87079583 |
13 | 5813475ac20a8 |
14 | 244c6b7dd7479 |
15 | 102298d63d026 |
hex | 772512b166f3 |
131001111111411 has 6 divisors (see below), whose sum is σ = 189223827160940. Its totient is φ = 87334074074268.
The previous prime is 131001111111397. The next prime is 131001111111419. The reversal of 131001111111411 is 114111111100131.
131001111111411 is a `hidden beast` number, since 1 + 31 + 0 + 0 + 1 + 111 + 111 + 411 = 666.
It is not a de Polignac number, because 131001111111411 - 29 = 131001111110899 is a prime.
It is a super-2 number, since 2×1310011111114112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131001111111419) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7277839506181 + ... + 7277839506198.
Almost surely, 2131001111111411 is an apocalyptic number.
131001111111411 is a deficient number, since it is larger than the sum of its proper divisors (58222716049529).
131001111111411 is a wasteful number, since it uses less digits than its factorization.
131001111111411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14555679012385 (or 14555679012382 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 18.
Adding to 131001111111411 its reverse (114111111100131), we get a palindrome (245112222211542).
The spelling of 131001111111411 in words is "one hundred thirty-one trillion, one billion, one hundred eleven million, one hundred eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •