Base | Representation |
---|---|
bin | 100010110010100101101100… |
… | …100011010001001111110101 |
3 | 202001202121122011001000001120 |
4 | 202302211230203101033311 |
5 | 130023404020430330023 |
6 | 1301231500553014153 |
7 | 44141416132042545 |
oct | 4262455443211765 |
9 | 661677564030046 |
10 | 153010031105013 |
11 | 4483220a660675 |
12 | 151b24519b4359 |
13 | 674ba266571c4 |
14 | 29ada21651325 |
15 | 12a521e6278e3 |
hex | 8b296c8d13f5 |
153010031105013 has 32 divisors (see below), whose sum is σ = 207036024074880. Its totient is φ = 100505898904320.
The previous prime is 153010031104991. The next prime is 153010031105021. The reversal of 153010031105013 is 310501130010351.
It is a happy number.
153010031105013 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 153010031105013 - 212 = 153010031100917 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153010031105053) 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, 1011607770 + ... + 1011759012.
It is an arithmetic number, because the mean of its divisors is an integer number (6469875752340).
Almost surely, 2153010031105013 is an apocalyptic number.
It is an amenable number.
153010031105013 is a deficient number, since it is larger than the sum of its proper divisors (54025992969867).
153010031105013 is a wasteful number, since it uses less digits than its factorization.
153010031105013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168629.
The product of its (nonzero) digits is 675, while the sum is 24.
Adding to 153010031105013 its reverse (310501130010351), we get a palindrome (463511161115364).
The spelling of 153010031105013 in words is "one hundred fifty-three trillion, ten billion, thirty-one million, one hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •