Base | Representation |
---|---|
bin | 100010110110010010100000… |
… | …110101101010011110000101 |
3 | 202002122220222101022000100221 |
4 | 202312102200311222132011 |
5 | 130042040302210200423 |
6 | 1301544352550304341 |
7 | 44165660341020322 |
oct | 4266224065523605 |
9 | 662586871260327 |
10 | 153264311412613 |
11 | 44920036222315 |
12 | 152337979580b1 |
13 | 67699bb42c18b |
14 | 29bc064701b49 |
15 | 12abb530d5e5d |
hex | 8b64a0d6a785 |
153264311412613 has 16 divisors (see below), whose sum is σ = 165669826089600. Its totient is φ = 141310011352320.
The previous prime is 153264311412571. The next prime is 153264311412643. The reversal of 153264311412613 is 316214113462351.
It is a cyclic number.
It is not a de Polignac number, because 153264311412613 - 245 = 118079939323781 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 153264311412613.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153264311412643) 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, 240200881 + ... + 240838102.
It is an arithmetic number, because the mean of its divisors is an integer number (10354364130600).
Almost surely, 2153264311412613 is an apocalyptic number.
It is an amenable number.
153264311412613 is a deficient number, since it is larger than the sum of its proper divisors (12405514676987).
153264311412613 is a wasteful number, since it uses less digits than its factorization.
153264311412613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481039452.
The product of its digits is 311040, while the sum is 43.
Adding to 153264311412613 its reverse (316214113462351), we get a palindrome (469478424874964).
The spelling of 153264311412613 in words is "one hundred fifty-three trillion, two hundred sixty-four billion, three hundred eleven million, four hundred twelve thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •