Base | Representation |
---|---|
bin | 10010010001101… |
… | …10111000001000 |
3 | 101200111022012200 |
4 | 21020312320020 |
5 | 303222114442 |
6 | 23114040200 |
7 | 3541112652 |
oct | 1110667010 |
9 | 350438180 |
10 | 153316872 |
11 | 795a8265 |
12 | 43419060 |
13 | 259c0857 |
14 | 1650d6d2 |
15 | d6d734c |
hex | 9236e08 |
153316872 has 24 divisors (see below), whose sum is σ = 415233390. Its totient is φ = 51105600.
The previous prime is 153316843. The next prime is 153316879. The reversal of 153316872 is 278613351.
It can be written as a sum of positive squares in only one way, i.e., 152621316 + 695556 = 12354^2 + 834^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (153316879) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1064629 + ... + 1064772.
Almost surely, 2153316872 is an apocalyptic number.
153316872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
153316872 is an abundant number, since it is smaller than the sum of its proper divisors (261916518).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153316872 is a wasteful number, since it uses less digits than its factorization.
153316872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2129413 (or 2129406 counting only the distinct ones).
The product of its digits is 30240, while the sum is 36.
The square root of 153316872 is about 12382.1190432010. The cubic root of 153316872 is about 535.2171034906.
The spelling of 153316872 in words is "one hundred fifty-three million, three hundred sixteen thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •