Base | Representation |
---|---|
bin | 111101000001011111… |
… | …0011100001101111101 |
3 | 110112020211222011111200 |
4 | 1322002332130031331 |
5 | 4121340341103334 |
6 | 140111335410113 |
7 | 12316311144321 |
oct | 1720276341575 |
9 | 415224864450 |
10 | 131046425469 |
11 | 50638322073 |
12 | 21493223939 |
13 | c4859180bb |
14 | 64b245d981 |
15 | 361eb65799 |
hex | 1e82f9c37d |
131046425469 has 12 divisors (see below), whose sum is σ = 191240718396. Its totient is φ = 86463620352.
The previous prime is 131046425467. The next prime is 131046425507. The reversal of 131046425469 is 964524640131.
131046425469 is a `hidden beast` number, since 1 + 3 + 104 + 64 + 25 + 469 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 52457031225 + 78589394244 = 229035^2 + 280338^2 .
It is not a de Polignac number, because 131046425469 - 21 = 131046425467 is a prime.
It is a super-2 number, since 2×1310464254692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131046425467) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 75054354 + ... + 75056099.
It is an arithmetic number, because the mean of its divisors is an integer number (15936726533).
Almost surely, 2131046425469 is an apocalyptic number.
It is an amenable number.
131046425469 is a deficient number, since it is larger than the sum of its proper divisors (60194292927).
131046425469 is a wasteful number, since it uses less digits than its factorization.
131046425469 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150110556 (or 150110553 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 45.
The spelling of 131046425469 in words is "one hundred thirty-one billion, forty-six million, four hundred twenty-five thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •