Base | Representation |
---|---|
bin | 10010000111110… |
… | …10011110101100 |
3 | 101121001110111000 |
4 | 21003322132230 |
5 | 302404132113 |
6 | 23030200300 |
7 | 3524104434 |
oct | 1103723654 |
9 | 347043430 |
10 | 152020908 |
11 | 788a2616 |
12 | 42ab3090 |
13 | 25658a00 |
14 | 162932c4 |
15 | d52d373 |
hex | 90fa7ac |
152020908 has 72 divisors (see below), whose sum is σ = 426829200. Its totient is φ = 46770048.
The previous prime is 152020879. The next prime is 152020909. The reversal of 152020908 is 809020251.
It is a super-2 number, since 2×1520209082 = 46220712938288928, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (152020909) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14088 + ... + 22416.
Almost surely, 2152020908 is an apocalyptic number.
152020908 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 152020908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (213414600).
152020908 is an abundant number, since it is smaller than the sum of its proper divisors (274808292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152020908 is a wasteful number, since it uses less digits than its factorization.
152020908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8368 (or 8347 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 152020908 is about 12329.6759081494. The cubic root of 152020908 is about 533.7047983338.
The spelling of 152020908 in words is "one hundred fifty-two million, twenty thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •