Base | Representation |
---|---|
bin | 11101100101101001111100… |
… | …101111101111001111000000 |
3 | 122001202101212222020122021120 |
4 | 131211221330233233033000 |
5 | 114024031303034220412 |
6 | 1140433210040152240 |
7 | 36260440534424043 |
oct | 3545517457571700 |
9 | 561671788218246 |
10 | 130131012023232 |
11 | 385112858623a0 |
12 | 12718318768680 |
13 | 577c3c001661c |
14 | 241c535c24c5a |
15 | 100a0161b5b8c |
hex | 765a7cbef3c0 |
130131012023232 has 56 divisors (see below), whose sum is σ = 375605421073152. Its totient is φ = 39433640006400.
The previous prime is 130131012023231. The next prime is 130131012023293. The reversal of 130131012023232 is 232320210131031.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130131012023231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30807529144 + ... + 30807533367.
Almost surely, 2130131012023232 is an apocalyptic number.
130131012023232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130131012023232 is an abundant number, since it is smaller than the sum of its proper divisors (245474409049920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130131012023232 is a wasteful number, since it uses less digits than its factorization.
130131012023232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61615062537 (or 61615062527 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 130131012023232 its reverse (232320210131031), we get a palindrome (362451222154263).
The spelling of 130131012023232 in words is "one hundred thirty trillion, one hundred thirty-one billion, twelve million, twenty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •