Base | Representation |
---|---|
bin | 111101010001000101… |
… | …0011100101110001100 |
3 | 110120121022112120220000 |
4 | 1322202022130232030 |
5 | 4123423313320311 |
6 | 140235310324300 |
7 | 12335263500600 |
oct | 1724212345614 |
9 | 416538476800 |
10 | 131569666956 |
11 | 50886713152 |
12 | 215ba4b9690 |
13 | c53a149b50 |
14 | 6521b45500 |
15 | 3650a70056 |
hex | 1ea229cb8c |
131569666956 has 360 divisors, whose sum is σ = 432455473296. Its totient is φ = 34573029120.
The previous prime is 131569666937. The next prime is 131569666961. The reversal of 131569666956 is 659666965131.
131569666956 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a junction number, because it is equal to n+sod(n) for n = 131569666893 and 131569666902.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 65423991 + ... + 65426001.
Almost surely, 2131569666956 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 131569666956, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (216227736648).
131569666956 is an abundant number, since it is smaller than the sum of its proper divisors (300885806340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131569666956 is a wasteful number, since it uses less digits than its factorization.
131569666956 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2371 (or 2353 counting only the distinct ones).
The product of its digits is 47239200, while the sum is 63.
The spelling of 131569666956 in words is "one hundred thirty-one billion, five hundred sixty-nine million, six hundred sixty-six thousand, nine hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •