Base | Representation |
---|---|
bin | 1111100111110… |
… | …01110000111000 |
3 | 100010120211221110 |
4 | 13303321300320 |
5 | 232021441311 |
6 | 21000440320 |
7 | 3150606432 |
oct | 763716070 |
9 | 303524843 |
10 | 131046456 |
11 | 67a77162 |
12 | 37a790a0 |
13 | 211c3ba8 |
14 | 13593652 |
15 | b7888a6 |
hex | 7cf9c38 |
131046456 has 64 divisors (see below), whose sum is σ = 349873920. Its totient is φ = 40803840.
The previous prime is 131046397. The next prime is 131046491. The reversal of 131046456 is 654640131.
It is a hoax number, since the sum of its digits (30) coincides with the sum of the digits of its distinct prime factors.
It is a zygodrome in base 2.
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, 20976 + ... + 26496.
It is an arithmetic number, because the mean of its divisors is an integer number (5466780).
Almost surely, 2131046456 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131046456, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (174936960).
131046456 is an abundant number, since it is smaller than the sum of its proper divisors (218827464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131046456 is a wasteful number, since it uses less digits than its factorization.
131046456 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5596 (or 5592 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 131046456 is about 11447.5524021513. The cubic root of 131046456 is about 507.9353359732.
Adding to 131046456 its reverse (654640131), we get a palindrome (785686587).
The spelling of 131046456 in words is "one hundred thirty-one million, forty-six thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •