Base | Representation |
---|---|
bin | 111100110001101000… |
… | …0111110110110110111 |
3 | 110110212202220020101101 |
4 | 1321203100332312313 |
5 | 4114243142240111 |
6 | 135542452510531 |
7 | 12300161136430 |
oct | 1714320766667 |
9 | 413782806341 |
10 | 130514415031 |
11 | 50394a91820 |
12 | 2136501b447 |
13 | c3cc635c20 |
14 | 6461934487 |
15 | 35dd0c7bc1 |
hex | 1e6343edb7 |
130514415031 has 64 divisors (see below), whose sum is σ = 177666048000. Its totient is φ = 92582208000.
The previous prime is 130514415019. The next prime is 130514415067.
130514415031 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 130514415031 - 223 = 130506026423 is a prime.
It is a super-2 number, since 2×1305144150312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130514415931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 27193770 + ... + 27198568.
It is an arithmetic number, because the mean of its divisors is an integer number (2776032000).
Almost surely, 2130514415031 is an apocalyptic number.
130514415031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130514415031 is a deficient number, since it is larger than the sum of its proper divisors (47151632969).
130514415031 is a wasteful number, since it uses less digits than its factorization.
130514415031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5200.
The product of its (nonzero) digits is 3600, while the sum is 28.
It can be divided in two parts, 130514 and 415031, that added together give a palindrome (545545).
The spelling of 130514415031 in words is "one hundred thirty billion, five hundred fourteen million, four hundred fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •