Base | Representation |
---|---|
bin | 111101000001110010… |
… | …0101100001101010000 |
3 | 110112021112211120220200 |
4 | 1322003210230031100 |
5 | 4121400422434212 |
6 | 140112334335200 |
7 | 12316462315413 |
oct | 1720344541520 |
9 | 415245746820 |
10 | 131056452432 |
11 | 50642a50514 |
12 | 2149665a500 |
13 | c487a19009 |
14 | 64b390db7a |
15 | 36209966dc |
hex | 1e8392c350 |
131056452432 has 30 divisors (see below), whose sum is σ = 366776044362. Its totient is φ = 43685484096.
The previous prime is 131056452391. The next prime is 131056452487. The reversal of 131056452432 is 234254650131.
131056452432 is a `hidden beast` number, since 1 + 3 + 1 + 0 + 5 + 645 + 2 + 4 + 3 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 107896482576 + 23159969856 = 328476^2 + 152184^2 .
It is a super-2 number, since 2×1310564524322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 455056983 + ... + 455057270.
Almost surely, 2131056452432 is an apocalyptic number.
131056452432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
131056452432 is an abundant number, since it is smaller than the sum of its proper divisors (235719591930).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131056452432 is a wasteful number, since it uses less digits than its factorization.
131056452432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 910114267 (or 910114258 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
The spelling of 131056452432 in words is "one hundred thirty-one billion, fifty-six million, four hundred fifty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •