Base | Representation |
---|---|
bin | 111100101001011101… |
… | …0010101010000101111 |
3 | 110110011122121122101102 |
4 | 1321102322111100233 |
5 | 4113212422321111 |
6 | 135455332033315 |
7 | 12260320043231 |
oct | 1712272252057 |
9 | 413148548342 |
10 | 130240042031 |
11 | 50264121280 |
12 | 212a916283b |
13 | c38783b838 |
14 | 6437312251 |
15 | 35c3e7c13b |
hex | 1e52e9542f |
130240042031 has 32 divisors (see below), whose sum is σ = 154678035456. Its totient is φ = 108314496000.
The previous prime is 130240042013. The next prime is 130240042043.
130240042031 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 130240042031 - 214 = 130240025647 is a prime.
It is a super-2 number, since 2×1302400420312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130240041994 and 130240042012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130240042061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2046416 + ... + 2109098.
It is an arithmetic number, because the mean of its divisors is an integer number (4833688608).
Almost surely, 2130240042031 is an apocalyptic number.
130240042031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130240042031 is a deficient number, since it is larger than the sum of its proper divisors (24437993425).
130240042031 is a wasteful number, since it uses less digits than its factorization.
130240042031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63023.
The product of its (nonzero) digits is 576, while the sum is 20.
It can be divided in two parts, 1302400 and 42031, that added together give a palindrome (1344431).
The spelling of 130240042031 in words is "one hundred thirty billion, two hundred forty million, forty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •