Base | Representation |
---|---|
bin | 1111101011110… |
… | …01010101101010 |
3 | 100011120101202000 |
4 | 13311321111222 |
5 | 232140202002 |
6 | 21015551430 |
7 | 3155214045 |
oct | 765712552 |
9 | 304511660 |
10 | 131569002 |
11 | 682a3814 |
12 | 3808b576 |
13 | 213479a6 |
14 | 1368bc5c |
15 | b83d61c |
hex | 7d7956a |
131569002 has 32 divisors (see below), whose sum is σ = 297898560. Its totient is φ = 43027920.
The previous prime is 131568989. The next prime is 131569021. The reversal of 131569002 is 200965131.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20124 + ... + 25847.
It is an arithmetic number, because the mean of its divisors is an integer number (9309330).
Almost surely, 2131569002 is an apocalyptic number.
131569002 is an abundant number, since it is smaller than the sum of its proper divisors (166329558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131569002 is a wasteful number, since it uses less digits than its factorization.
131569002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46035 (or 46029 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 131569002 is about 11470.3531767771. The cubic root of 131569002 is about 508.6095690656.
The spelling of 131569002 in words is "one hundred thirty-one million, five hundred sixty-nine thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •