Base | Representation |
---|---|
bin | 11101101011001100010001… |
… | …011101010010101101010111 |
3 | 122010002202220022222101101100 |
4 | 131223030101131102231113 |
5 | 114101244434303140111 |
6 | 1141324050001001143 |
7 | 36330066514022046 |
oct | 3553142135225527 |
9 | 563082808871340 |
10 | 130511464115031 |
11 | 3864866807aa5a |
12 | 12779bb53231b3 |
13 | 57a9241829b7c |
14 | 2432b07b8655d |
15 | 1014d81896756 |
hex | 76b311752b57 |
130511464115031 has 24 divisors (see below), whose sum is σ = 200551767599664. Its totient is φ = 81501443976960.
The previous prime is 130511464114979. The next prime is 130511464115041.
130511464115031 is a `hidden beast` number, since 1 + 3 + 0 + 5 + 1 + 1 + 4 + 641 + 1 + 5 + 0 + 3 + 1 = 666.
130511464115031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 130511464115031 - 213 = 130511464106839 is a prime.
It is a super-2 number, since 2×1305114641150312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130511464115041) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2021332896 + ... + 2021397461.
It is an arithmetic number, because the mean of its divisors is an integer number (8356323649986).
Almost surely, 2130511464115031 is an apocalyptic number.
130511464115031 is a deficient number, since it is larger than the sum of its proper divisors (70040303484633).
130511464115031 is a wasteful number, since it uses less digits than its factorization.
130511464115031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4042730591 (or 4042730588 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 36.
The spelling of 130511464115031 in words is "one hundred thirty trillion, five hundred eleven billion, four hundred sixty-four million, one hundred fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •