Base | Representation |
---|---|
bin | 1000111010111111001… |
… | …0010011100000011100 |
3 | 112122121212021221121110 |
4 | 2032233302103200130 |
5 | 10002400400232020 |
6 | 154225045302020 |
7 | 14034151321263 |
oct | 2165762234034 |
9 | 478555257543 |
10 | 153273055260 |
11 | 5a003709aa6 |
12 | 25856a04910 |
13 | 115b86b9350 |
14 | 75c03555da |
15 | 3ec110d8e0 |
hex | 23afc9381c |
153273055260 has 96 divisors (see below), whose sum is σ = 464731106112. Its totient is φ = 37520271360.
The previous prime is 153273055253. The next prime is 153273055279. The reversal of 153273055260 is 62550372351.
153273055260 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 401649 + ... + 684008.
It is an arithmetic number, because the mean of its divisors is an integer number (4840949022).
Almost surely, 2153273055260 is an apocalyptic number.
153273055260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
153273055260 is an abundant number, since it is smaller than the sum of its proper divisors (311458050852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153273055260 is a wasteful number, since it uses less digits than its factorization.
153273055260 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1085863 (or 1085861 counting only the distinct ones).
The product of its (nonzero) digits is 189000, while the sum is 39.
The spelling of 153273055260 in words is "one hundred fifty-three billion, two hundred seventy-three million, fifty-five thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •