Base | Representation |
---|---|
bin | 11101110101101101100100… |
… | …011001011101010010001110 |
3 | 122012122212221200102211112020 |
4 | 131311231210121131102032 |
5 | 114200121032442440210 |
6 | 1143040131122551010 |
7 | 36433242010510134 |
oct | 3565554431352216 |
9 | 565585850384466 |
10 | 131234410124430 |
11 | 388a7223272088 |
12 | 12876136508466 |
13 | 582c475b01362 |
14 | 2459aca723754 |
15 | 1028a95146770 |
hex | 775b6465d48e |
131234410124430 has 64 divisors (see below), whose sum is σ = 344247530508288. Its totient is φ = 31874771335680.
The previous prime is 131234410124417. The next prime is 131234410124491. The reversal of 131234410124430 is 34421014432131.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 131234410124391 and 131234410124400.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4150345042 + ... + 4150376661.
It is an arithmetic number, because the mean of its divisors is an integer number (5378867664192).
Almost surely, 2131234410124430 is an apocalyptic number.
131234410124430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131234410124430 is an abundant number, since it is smaller than the sum of its proper divisors (213013120383858).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131234410124430 is a wasteful number, since it uses less digits than its factorization.
131234410124430 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8300721761.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 131234410124430 its reverse (34421014432131), we get a palindrome (165655424556561).
The spelling of 131234410124430 in words is "one hundred thirty-one trillion, two hundred thirty-four billion, four hundred ten million, one hundred twenty-four thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •