Base | Representation |
---|---|
bin | 11101111001000100010110… |
… | …100011101111011000110001 |
3 | 122020110221020010222212201220 |
4 | 131321010112203233120301 |
5 | 114212410341300244103 |
6 | 1143334111355215253 |
7 | 36456015025666251 |
oct | 3571042643573061 |
9 | 566427203885656 |
10 | 131465032431153 |
11 | 38986009580593 |
12 | 128b2979447529 |
13 | 584813a3c1545 |
14 | 2466d27761961 |
15 | 102ea91b6bc53 |
hex | 7791168ef631 |
131465032431153 has 16 divisors (see below), whose sum is σ = 180050990213376. Its totient is φ = 85282772631680.
The previous prime is 131465032431091. The next prime is 131465032431157. The reversal of 131465032431153 is 351134230564131.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131465032431153 is a prime.
It is a super-2 number, since 2×1314650324311532 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (131465032431157) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2694704268 + ... + 2694753053.
It is an arithmetic number, because the mean of its divisors is an integer number (11253186888336).
Almost surely, 2131465032431153 is an apocalyptic number.
It is an amenable number.
131465032431153 is a deficient number, since it is larger than the sum of its proper divisors (48585957782223).
131465032431153 is a wasteful number, since it uses less digits than its factorization.
131465032431153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5389457544.
The product of its (nonzero) digits is 388800, while the sum is 42.
Adding to 131465032431153 its reverse (351134230564131), we get a palindrome (482599262995284).
The spelling of 131465032431153 in words is "one hundred thirty-one trillion, four hundred sixty-five billion, thirty-two million, four hundred thirty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •