Base | Representation |
---|---|
bin | 111100101011110111… |
… | …1010101001000111111 |
3 | 110110101022000222020111 |
4 | 1321113233111020333 |
5 | 4113344141402111 |
6 | 135511344130451 |
7 | 12262322411533 |
oct | 1712757251077 |
9 | 413338028214 |
10 | 130321044031 |
11 | 502a5917282 |
12 | 21310306a27 |
13 | c39b560009 |
14 | 6443d99bc3 |
15 | 35cb12ca21 |
hex | 1e57bd523f |
130321044031 has 4 divisors (see below), whose sum is σ = 131347194112. Its totient is φ = 129294893952.
The previous prime is 130321044017. The next prime is 130321044043. The reversal of 130321044031 is 130440123031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130321044031 - 29 = 130321043519 is a prime.
It is a super-2 number, since 2×1303210440312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130321043993 and 130321044011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130321044071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 513074850 + ... + 513075103.
It is an arithmetic number, because the mean of its divisors is an integer number (32836798528).
Almost surely, 2130321044031 is an apocalyptic number.
130321044031 is a deficient number, since it is larger than the sum of its proper divisors (1026150081).
130321044031 is a wasteful number, since it uses less digits than its factorization.
130321044031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1026150080.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 130321044031 its reverse (130440123031), we get a palindrome (260761167062).
The spelling of 130321044031 in words is "one hundred thirty billion, three hundred twenty-one million, forty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •