Base | Representation |
---|---|
bin | 111100100110100100… |
… | …1011100100111100111 |
3 | 110102220220122201112220 |
4 | 1321031021130213213 |
5 | 4113013143403111 |
6 | 135441555243423 |
7 | 12255034101144 |
oct | 1711511344747 |
9 | 412826581486 |
10 | 130143341031 |
11 | 502145833a0 |
12 | 212808a9573 |
13 | c3707b1802 |
14 | 642853d3cb |
15 | 35ba729e06 |
hex | 1e4d25c9e7 |
130143341031 has 32 divisors (see below), whose sum is σ = 192549692160. Its totient is φ = 77531712000.
The previous prime is 130143341023. The next prime is 130143341087.
130143341031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 130143341031 - 23 = 130143341023 is a prime.
It is a super-2 number, since 2×1301433410312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130143340992 and 130143341010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130143341131) 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, 322831 + ... + 603743.
It is an arithmetic number, because the mean of its divisors is an integer number (6017177880).
Almost surely, 2130143341031 is an apocalyptic number.
130143341031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130143341031 is a deficient number, since it is larger than the sum of its proper divisors (62406351129).
130143341031 is a wasteful number, since it uses less digits than its factorization.
130143341031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281167.
The product of its (nonzero) digits is 1296, while the sum is 24.
It can be divided in two parts, 130143 and 341031, that added together give a palindrome (471174).
The spelling of 130143341031 in words is "one hundred thirty billion, one hundred forty-three million, three hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •