Base | Representation |
---|---|
bin | 111100101011111001… |
… | …1110100111110110111 |
3 | 110110101101020212112011 |
4 | 1321113303310332313 |
5 | 4113344442114111 |
6 | 135511425305051 |
7 | 12262335422050 |
oct | 1712763647667 |
9 | 413341225464 |
10 | 130322223031 |
11 | 502a6552060 |
12 | 21310795187 |
13 | c39b883850 |
14 | 64441c5727 |
15 | 35cb2b2021 |
hex | 1e57cf4fb7 |
130322223031 has 32 divisors (see below), whose sum is σ = 176026088448. Its totient is φ = 93176835840.
The previous prime is 130322222999. The next prime is 130322223037.
130322223031 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 130322223031 - 25 = 130322222999 is a prime.
It is a super-2 number, since 2×1303222230312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130322222993 and 130322223011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130322223037) 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, 222630 + ... + 556963.
It is an arithmetic number, because the mean of its divisors is an integer number (5500815264).
Almost surely, 2130322223031 is an apocalyptic number.
130322223031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130322223031 is a deficient number, since it is larger than the sum of its proper divisors (45703865417).
130322223031 is a wasteful number, since it uses less digits than its factorization.
130322223031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 779791.
The product of its (nonzero) digits is 1296, while the sum is 22.
It can be divided in two parts, 130322 and 223031, that added together give a palindrome (353353).
The spelling of 130322223031 in words is "one hundred thirty billion, three hundred twenty-two million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •