Base | Representation |
---|---|
bin | 10010001000010… |
… | …11101010000110 |
3 | 101121012001000000 |
4 | 21010023222012 |
5 | 302413410040 |
6 | 23031502130 |
7 | 3524516532 |
oct | 1104135206 |
9 | 347161000 |
10 | 152091270 |
11 | 78940471 |
12 | 42b27946 |
13 | 25681a46 |
14 | 162b0bc2 |
15 | d544130 |
hex | 910ba86 |
152091270 has 112 divisors (see below), whose sum is σ = 424328832. Its totient is φ = 39191040.
The previous prime is 152091253. The next prime is 152091271. The reversal of 152091270 is 72190251.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152091271) 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 55 ways as a sum of consecutive naturals, for example, 225654 + ... + 226326.
Almost surely, 2152091270 is an apocalyptic number.
152091270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 152091270, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (212164416).
152091270 is an abundant number, since it is smaller than the sum of its proper divisors (272237562).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152091270 is an equidigital number, since it uses as much as digits as its factorization.
152091270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729 (or 714 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 152091270 is about 12332.5289377321. The cubic root of 152091270 is about 533.7871263621.
The spelling of 152091270 in words is "one hundred fifty-two million, ninety-one thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •