Base | Representation |
---|---|
bin | 1000111010110111010… |
… | …1110000001001111011 |
3 | 112122112120212010022212 |
4 | 2032231311300021323 |
5 | 10002314020421403 |
6 | 154221521405335 |
7 | 14033303642666 |
oct | 2165565601173 |
9 | 478476763285 |
10 | 153240404603 |
11 | 59a97239090 |
12 | 25847a9984b |
13 | 115b19c6a30 |
14 | 75b9c966dd |
15 | 3ebd30e4d8 |
hex | 23add7027b |
153240404603 has 16 divisors (see below), whose sum is σ = 182309568000. Its totient is φ = 126965573280.
The previous prime is 153240404591. The next prime is 153240404621. The reversal of 153240404603 is 306404042351.
It is not a de Polignac number, because 153240404603 - 28 = 153240404347 is a prime.
It is a super-2 number, since 2×1532404046032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 153240404603.
It is not an unprimeable number, because it can be changed into a prime (153240404623) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6771053 + ... + 6793646.
It is an arithmetic number, because the mean of its divisors is an integer number (11394348000).
Almost surely, 2153240404603 is an apocalyptic number.
153240404603 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
153240404603 is a deficient number, since it is larger than the sum of its proper divisors (29069163397).
153240404603 is a wasteful number, since it uses less digits than its factorization.
153240404603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13564802.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 153240404603 its reverse (306404042351), we get a palindrome (459644446954).
The spelling of 153240404603 in words is "one hundred fifty-three billion, two hundred forty million, four hundred four thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •