Base | Representation |
---|---|
bin | 111100100101111110… |
… | …1100010100010101000 |
3 | 110102212112012202200111 |
4 | 1321023331202202220 |
5 | 4112443100123334 |
6 | 135440004544104 |
7 | 12254403003400 |
oct | 1711375424250 |
9 | 412775182614 |
10 | 130123442344 |
11 | 502043221a5 |
12 | 212760b2034 |
13 | c36963553c |
14 | 6425a3d800 |
15 | 35b8ae9064 |
hex | 1e4bf628a8 |
130123442344 has 48 divisors (see below), whose sum is σ = 286326897300. Its totient is φ = 55273655808.
The previous prime is 130123442321. The next prime is 130123442387. The reversal of 130123442344 is 443244321031.
It can be written as a sum of positive squares in 2 ways, for example, as 112116486244 + 18006956100 = 334838^2 + 134190^2 .
It is a super-2 number, since 2×1301234423442 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1424499 + ... + 1513090.
Almost surely, 2130123442344 is an apocalyptic number.
130123442344 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
130123442344 is an abundant number, since it is smaller than the sum of its proper divisors (156203454956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130123442344 is a wasteful number, since it uses less digits than its factorization.
130123442344 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2937722 (or 2937711 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 130123442344 its reverse (443244321031), we get a palindrome (573367763375).
The spelling of 130123442344 in words is "one hundred thirty billion, one hundred twenty-three million, four hundred forty-two thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •