Base | Representation |
---|---|
bin | 1000111010101110100… |
… | …0111111010100111011 |
3 | 112122110000102101211021 |
4 | 2032223220333110323 |
5 | 10002230044120233 |
6 | 154214122443311 |
7 | 14032345205233 |
oct | 2165350772473 |
9 | 478400371737 |
10 | 153203504443 |
11 | 59a78425490 |
12 | 25837663537 |
13 | 115a7177112 |
14 | 75b500ccc3 |
15 | 3eb9e70e2d |
hex | 23aba3f53b |
153203504443 has 4 divisors (see below), whose sum is σ = 167131095768. Its totient is φ = 139275913120.
The previous prime is 153203504437. The next prime is 153203504477. The reversal of 153203504443 is 344405302351.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 153203504443 - 29 = 153203503931 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 153203504399 and 153203504408.
It is not an unprimeable number, because it can be changed into a prime (153203504843) 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 3 ways as a sum of consecutive naturals, for example, 6963795646 + ... + 6963795667.
It is an arithmetic number, because the mean of its divisors is an integer number (41782773942).
Almost surely, 2153203504443 is an apocalyptic number.
153203504443 is a deficient number, since it is larger than the sum of its proper divisors (13927591325).
153203504443 is a wasteful number, since it uses less digits than its factorization.
153203504443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13927591324.
The product of its (nonzero) digits is 86400, while the sum is 34.
Adding to 153203504443 its reverse (344405302351), we get a palindrome (497608806794).
The spelling of 153203504443 in words is "one hundred fifty-three billion, two hundred three million, five hundred four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •