Base | Representation |
---|---|
bin | 111100101001011111… |
… | …0100001110100001111 |
3 | 110110011201200112022011 |
4 | 1321102332201310033 |
5 | 4113213213021111 |
6 | 135455411402051 |
7 | 12260332304230 |
oct | 1712276416417 |
9 | 413151615264 |
10 | 130241142031 |
11 | 50264802770 |
12 | 212a95b3327 |
13 | c387b35420 |
14 | 643751b087 |
15 | 35c40e8021 |
hex | 1e52fa1d0f |
130241142031 has 32 divisors (see below), whose sum is σ = 184072896000. Its totient is φ = 88749406080.
The previous prime is 130241142023. The next prime is 130241142103.
130241142031 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 130241142031 - 23 = 130241142023 is a prime.
It is a super-2 number, since 2×1302411420312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130241141993 and 130241142011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130241142001) 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, 3404956 + ... + 3442993.
It is an arithmetic number, because the mean of its divisors is an integer number (5752278000).
Almost surely, 2130241142031 is an apocalyptic number.
130241142031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130241142031 is a deficient number, since it is larger than the sum of its proper divisors (53831753969).
130241142031 is a wasteful number, since it uses less digits than its factorization.
130241142031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6847999.
The product of its (nonzero) digits is 576, while the sum is 22.
It can be divided in two parts, 130241 and 142031, that added together give a palindrome (272272).
The spelling of 130241142031 in words is "one hundred thirty billion, two hundred forty-one million, one hundred forty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •