Base | Representation |
---|---|
bin | 1000111100011011101… |
… | …0001111110010011001 |
3 | 112200121220022020210000 |
4 | 2033012322033302121 |
5 | 10004144204410040 |
6 | 154331344443213 |
7 | 14046602026653 |
oct | 2170672176231 |
9 | 480556266700 |
10 | 153661013145 |
11 | 5a1926aa552 |
12 | 25944919509 |
13 | 1164aba2723 |
14 | 7619aa36d3 |
15 | 3ee51e4130 |
hex | 23c6e8fc99 |
153661013145 has 120 divisors (see below), whose sum is σ = 290682919296. Its totient is φ = 77645189952.
The previous prime is 153661013101. The next prime is 153661013153. The reversal of 153661013145 is 541310166351.
153661013145 is a `hidden beast` number, since 1 + 5 + 3 + 6 + 610 + 1 + 31 + 4 + 5 = 666.
It is not a de Polignac number, because 153661013145 - 217 = 153660882073 is a prime.
It is a super-2 number, since 2×1536610131452 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 119 ways as a sum of consecutive naturals, for example, 22920864 + ... + 22927566.
Almost surely, 2153661013145 is an apocalyptic number.
153661013145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
153661013145 is a deficient number, since it is larger than the sum of its proper divisors (137021906151).
153661013145 is a wasteful number, since it uses less digits than its factorization.
153661013145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6873 (or 6841 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
Adding to 153661013145 its reverse (541310166351), we get a palindrome (694971179496).
The spelling of 153661013145 in words is "one hundred fifty-three billion, six hundred sixty-one million, thirteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •