Base | Representation |
---|---|
bin | 10010010000110… |
… | …10100111111110 |
3 | 101200021102110200 |
4 | 21020122213332 |
5 | 303204414100 |
6 | 23111344330 |
7 | 3540121404 |
oct | 1110324776 |
9 | 350242420 |
10 | 153201150 |
11 | 79529323 |
12 | 433820a6 |
13 | 2597cc8b |
14 | 164bd474 |
15 | d6b2e00 |
hex | 921a9fe |
153201150 has 36 divisors (see below), whose sum is σ = 411601632. Its totient is φ = 40853520.
The previous prime is 153201119. The next prime is 153201227. The reversal of 153201150 is 51102351.
It is a super-2 number, since 2×1532011502 = 46941184722645000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 169774 + ... + 170673.
Almost surely, 2153201150 is an apocalyptic number.
153201150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
153201150 is an abundant number, since it is smaller than the sum of its proper divisors (258400482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
153201150 is a wasteful number, since it uses less digits than its factorization.
153201150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 340465 (or 340457 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 153201150 is about 12377.4452129670. The cubic root of 153201150 is about 535.0824108062.
It can be divided in two parts, 153201 and 150, that added together give a palindrome (153351).
The spelling of 153201150 in words is "one hundred fifty-three million, two hundred one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •