Base | Representation |
---|---|
bin | 10010001001010… |
… | …10011110001000 |
3 | 101121102110010110 |
4 | 21010222132020 |
5 | 302431424410 |
6 | 23034314320 |
7 | 3525553512 |
oct | 1104523610 |
9 | 347373113 |
10 | 152217480 |
11 | 78a17278 |
12 | 42b889a0 |
13 | 256c731c |
14 | 16304bb2 |
15 | d56b720 |
hex | 912a788 |
152217480 has 32 divisors (see below), whose sum is σ = 456652800. Its totient is φ = 40591296.
The previous prime is 152217479. The next prime is 152217487. The reversal of 152217480 is 84712251.
It is a super-2 number, since 2×1522174802 = 46340322435100800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (152217487) 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 7 ways as a sum of consecutive naturals, for example, 634120 + ... + 634359.
It is an arithmetic number, because the mean of its divisors is an integer number (14270400).
Almost surely, 2152217480 is an apocalyptic number.
152217480 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
152217480 is an abundant number, since it is smaller than the sum of its proper divisors (304435320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152217480 is a wasteful number, since it uses less digits than its factorization.
152217480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1268493 (or 1268489 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 30.
The square root of 152217480 is about 12337.6448319766. The cubic root of 152217480 is about 533.9347365148.
The spelling of 152217480 in words is "one hundred fifty-two million, two hundred seventeen thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •