Base | Representation |
---|---|
bin | 100011100100101101101101… |
… | …100001111010111010101101 |
3 | 202111221220200212101012100211 |
4 | 203210231231201322322231 |
5 | 131001323020443100023 |
6 | 1312430131201022421 |
7 | 44645321055436645 |
oct | 4344555541727255 |
9 | 674856625335324 |
10 | 156454611300013 |
11 | 45940034352004 |
12 | 15669b50924a11 |
13 | 693b7b674c540 |
14 | 2a8c62d2db525 |
15 | 1314b243cba0d |
hex | 8e4b6d87aead |
156454611300013 has 32 divisors (see below), whose sum is σ = 172530506558592. Its totient is φ = 140994653184000.
The previous prime is 156454611300007. The next prime is 156454611300049. The reversal of 156454611300013 is 310003116454651.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-156454611300013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (156454611300313) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1520682333 + ... + 1520785213.
It is an arithmetic number, because the mean of its divisors is an integer number (5391578329956).
Almost surely, 2156454611300013 is an apocalyptic number.
156454611300013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
156454611300013 is a deficient number, since it is larger than the sum of its proper divisors (16075895258579).
156454611300013 is a wasteful number, since it uses less digits than its factorization.
156454611300013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118525.
The product of its (nonzero) digits is 129600, while the sum is 40.
Adding to 156454611300013 its reverse (310003116454651), we get a palindrome (466457727754664).
The spelling of 156454611300013 in words is "one hundred fifty-six trillion, four hundred fifty-four billion, six hundred eleven million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •