Base | Representation |
---|---|
bin | 11101110010011100100111… |
… | …110110110100001110111000 |
3 | 122011212102212001210002020121 |
4 | 131302130213312310032320 |
5 | 114132432043331023112 |
6 | 1142345104445503024 |
7 | 36411110215041460 |
oct | 3562344766641670 |
9 | 564772761702217 |
10 | 131010056111032 |
11 | 3882006428218a |
12 | 1283a762871a74 |
13 | 5814270055c87 |
14 | 244ccc5db2ba0 |
15 | 1022d13aa3407 |
hex | 772727db43b8 |
131010056111032 has 64 divisors (see below), whose sum is σ = 283245570720000. Its totient is φ = 55646619826176.
The previous prime is 131010056111027. The next prime is 131010056111041. The reversal of 131010056111032 is 230111650010131.
It is a junction number, because it is equal to n+sod(n) for n = 131010056110988 and 131010056111006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10093282 + ... + 19076017.
It is an arithmetic number, because the mean of its divisors is an integer number (4425712042500).
Almost surely, 2131010056111032 is an apocalyptic number.
It is an amenable number.
131010056111032 is an abundant number, since it is smaller than the sum of its proper divisors (152235514608968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131010056111032 is a wasteful number, since it uses less digits than its factorization.
131010056111032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29170028 (or 29170024 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 25.
The spelling of 131010056111032 in words is "one hundred thirty-one trillion, ten billion, fifty-six million, one hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •