Base | Representation |
---|---|
bin | 100010110010011110010000… |
… | …010111011101100111011011 |
3 | 202001201212000101020012220012 |
4 | 202302132100113131213123 |
5 | 130023241140231231011 |
6 | 1301224100123552135 |
7 | 44141014143200123 |
oct | 4262362027354733 |
9 | 661655011205805 |
10 | 153002042055131 |
11 | 4482988aa92205 |
12 | 151b09a238b64b |
13 | 674b052479259 |
14 | 29ad4a45d7c83 |
15 | 12a4e03091a8b |
hex | 8b27905dd9db |
153002042055131 has 4 divisors (see below), whose sum is σ = 153003974295432. Its totient is φ = 153000109814832.
The previous prime is 153002042055101. The next prime is 153002042055167. The reversal of 153002042055131 is 131550240200351.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-153002042055131 is a prime.
It is a super-2 number, since 2×1530020420551312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (153002042055101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 966001370 + ... + 966159743.
It is an arithmetic number, because the mean of its divisors is an integer number (38250993573858).
Almost surely, 2153002042055131 is an apocalyptic number.
153002042055131 is a deficient number, since it is larger than the sum of its proper divisors (1932240301).
153002042055131 is an equidigital number, since it uses as much as digits as its factorization.
153002042055131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1932240300.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 153002042055131 its reverse (131550240200351), we get a palindrome (284552282255482).
The spelling of 153002042055131 in words is "one hundred fifty-three trillion, two billion, forty-two million, fifty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •