Base | Representation |
---|---|
bin | 100010111000011101000000… |
… | …101111011011100001001011 |
3 | 202010012010211100102110101110 |
4 | 202320131000233123201023 |
5 | 130102004332343134011 |
6 | 1302140545252221403 |
7 | 44212503503600226 |
oct | 4270350057334113 |
9 | 663163740373343 |
10 | 153413023021131 |
11 | 44978109031915 |
12 | 1525857b00a863 |
13 | 677aa2aaa93c3 |
14 | 29c5330d145bd |
15 | 12b0958a19ba6 |
hex | 8b8740bdb84b |
153413023021131 has 16 divisors (see below), whose sum is σ = 205433639277984. Its totient is φ = 101833899270144.
The previous prime is 153413023021087. The next prime is 153413023021133. The reversal of 153413023021131 is 131120320314351.
It is not a de Polignac number, because 153413023021131 - 27 = 153413023021003 is a prime.
It is a super-2 number, since 2×1534130230211312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (153413023021133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26026035 + ... + 31371651.
It is an arithmetic number, because the mean of its divisors is an integer number (12839602454874).
Almost surely, 2153413023021131 is an apocalyptic number.
153413023021131 is a deficient number, since it is larger than the sum of its proper divisors (52020616256853).
153413023021131 is a wasteful number, since it uses less digits than its factorization.
153413023021131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5386910.
The product of its (nonzero) digits is 6480, while the sum is 30.
Adding to 153413023021131 its reverse (131120320314351), we get a palindrome (284533343335482).
The spelling of 153413023021131 in words is "one hundred fifty-three trillion, four hundred thirteen billion, twenty-three million, twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •