Base | Representation |
---|---|
bin | 1111100000001… |
… | …00000011011111 |
3 | 100001200201101110 |
4 | 13300010003133 |
5 | 231242240111 |
6 | 20523113103 |
7 | 3136215312 |
oct | 760040337 |
9 | 301621343 |
10 | 130040031 |
11 | 6744a000 |
12 | 37672793 |
13 | 20c30a84 |
14 | 133b0979 |
15 | b63a5a6 |
hex | 7c040df |
130040031 has 32 divisors (see below), whose sum is σ = 197464320. Its totient is φ = 76026720.
The previous prime is 130040017. The next prime is 130040033.
130040031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 130040031 - 26 = 130039967 is a prime.
It is a super-2 number, since 2×1300400312 = 33820819324961922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130039989 and 130040016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130040033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 115236 + ... + 116358.
It is an arithmetic number, because the mean of its divisors is an integer number (6170760).
Almost surely, 2130040031 is an apocalyptic number.
130040031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130040031 is a deficient number, since it is larger than the sum of its proper divisors (67424289).
130040031 is a wasteful number, since it uses less digits than its factorization.
130040031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1188 (or 1166 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 130040031 is about 11403.5095913495. The cubic root of 130040031 is about 506.6316937329.
The spelling of 130040031 in words is "one hundred thirty million, forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •