Base | Representation |
---|---|
bin | 11101111011110000110000… |
… | …110011101011100101110100 |
3 | 122021010122001202102110021021 |
4 | 131323300300303223211310 |
5 | 114223424010020130002 |
6 | 1143555125200430524 |
7 | 36505260413602663 |
oct | 3573606063534564 |
9 | 567118052373237 |
10 | 131650156411252 |
11 | 38a475771aa866 |
12 | 12922823018444 |
13 | 585c73078307b |
14 | 2471c89c92dda |
15 | 10347c911b737 |
hex | 77bc30ceb974 |
131650156411252 has 24 divisors (see below), whose sum is σ = 230427606093440. Its totient is φ = 65813698117440.
The previous prime is 131650156411237. The next prime is 131650156411259. The reversal of 131650156411252 is 252114651056131.
131650156411252 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 131650156411199 and 131650156411208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131650156411259) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1542088024 + ... + 1542173392.
Almost surely, 2131650156411252 is an apocalyptic number.
It is an amenable number.
131650156411252 is a deficient number, since it is larger than the sum of its proper divisors (98777449682188).
131650156411252 is a wasteful number, since it uses less digits than its factorization.
131650156411252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147511 (or 147509 counting only the distinct ones).
The product of its (nonzero) digits is 216000, while the sum is 43.
The spelling of 131650156411252 in words is "one hundred thirty-one trillion, six hundred fifty billion, one hundred fifty-six million, four hundred eleven thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •