Base | Representation |
---|---|
bin | 111100100101111110… |
… | …0010010001010101100 |
3 | 110102212111121001002110 |
4 | 1321023330102022230 |
5 | 4112443004110012 |
6 | 135435553524020 |
7 | 12254400132525 |
oct | 1711374221254 |
9 | 412774531073 |
10 | 130123113132 |
11 | 50204117921 |
12 | 21275b73610 |
13 | c36954b73c |
14 | 642599584c |
15 | 35b8a8173c |
hex | 1e4bf122ac |
130123113132 has 24 divisors (see below), whose sum is σ = 303752156400. Its totient is φ = 43355576896.
The previous prime is 130123113097. The next prime is 130123113151. The reversal of 130123113132 is 231311321031.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 130123113099 and 130123113108.
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 7 ways as a sum of consecutive naturals, for example, 2320407 + ... + 2375822.
It is an arithmetic number, because the mean of its divisors is an integer number (12656339850).
Almost surely, 2130123113132 is an apocalyptic number.
130123113132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130123113132 is an abundant number, since it is smaller than the sum of its proper divisors (173629043268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130123113132 is a wasteful number, since it uses less digits than its factorization.
130123113132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4698545 (or 4698543 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 130123113132 its reverse (231311321031), we get a palindrome (361434434163).
The spelling of 130123113132 in words is "one hundred thirty billion, one hundred twenty-three million, one hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •