Base | Representation |
---|---|
bin | 10010000111110… |
… | …01110100100000 |
3 | 101121001022210000 |
4 | 21003321310200 |
5 | 302404040313 |
6 | 23030140000 |
7 | 3524063526 |
oct | 1103716440 |
9 | 347038700 |
10 | 152018208 |
11 | 788a0591 |
12 | 42ab1600 |
13 | 25657704 |
14 | 16292316 |
15 | d52c673 |
hex | 90f9d20 |
152018208 has 120 divisors (see below), whose sum is σ = 450793728. Its totient is φ = 50253696.
The previous prime is 152018197. The next prime is 152018213. The reversal of 152018208 is 802810251.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 577885 + ... + 578147.
Almost surely, 2152018208 is an apocalyptic number.
152018208 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 152018208, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (225396864).
152018208 is an abundant number, since it is smaller than the sum of its proper divisors (298775520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152018208 is a wasteful number, since it uses less digits than its factorization.
152018208 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 508 (or 491 counting only the distinct ones).
The product of its (nonzero) digits is 1280, while the sum is 27.
The square root of 152018208 is about 12329.5664157342. The cubic root of 152018208 is about 533.7016386555.
Adding to 152018208 its reverse (802810251), we get a palindrome (954828459).
It can be divided in two parts, 15201 and 8208, that added together give a square (23409 = 1532).
The spelling of 152018208 in words is "one hundred fifty-two million, eighteen thousand, two hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •