Base | Representation |
---|---|
bin | 100010110011111010011010… |
… | …110110001010100100011000 |
3 | 202002002022110002001120012012 |
4 | 202303322122312022210120 |
5 | 130031401323020423134 |
6 | 1301341343541405052 |
7 | 44151116361663116 |
oct | 4263723266124430 |
9 | 662068402046165 |
10 | 153101002123544 |
11 | 44867852400312 |
12 | 15207bbba09788 |
13 | 67574936aa157 |
14 | 29b41b14b4ab6 |
15 | 12a7795d5d6ce |
hex | 8b3e9ad8a918 |
153101002123544 has 8 divisors (see below), whose sum is σ = 287064378981660. Its totient is φ = 76550501061768.
The previous prime is 153101002123543. The next prime is 153101002123567. The reversal of 153101002123544 is 445321200101351.
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 153101002123544.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (153101002123543) 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 as a sum of consecutive naturals, namely, 9568812632714 + ... + 9568812632729.
Almost surely, 2153101002123544 is an apocalyptic number.
It is an amenable number.
153101002123544 is a deficient number, since it is larger than the sum of its proper divisors (133963376858116).
153101002123544 is a wasteful number, since it uses less digits than its factorization.
153101002123544 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19137625265449 (or 19137625265445 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 153101002123544 its reverse (445321200101351), we get a palindrome (598422202224895).
The spelling of 153101002123544 in words is "one hundred fifty-three trillion, one hundred one billion, two million, one hundred twenty-three thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •