Base | Representation |
---|---|
bin | 10010001001001… |
… | …01001110000000 |
3 | 101121101100121201 |
4 | 21010211032000 |
5 | 302430232333 |
6 | 23034030544 |
7 | 3525434011 |
oct | 1104451600 |
9 | 347340551 |
10 | 152195968 |
11 | 78a020a1 |
12 | 42b78454 |
13 | 256ba5b2 |
14 | 162db008 |
15 | d56517d |
hex | 9125380 |
152195968 has 64 divisors (see below), whose sum is σ = 335106720. Its totient is φ = 68485120.
The previous prime is 152195959. The next prime is 152195969. The reversal of 152195968 is 869591251.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1521959682 = 46327225350914048, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (152195969) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 48528 + ... + 51568.
Almost surely, 2152195968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 152195968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (167553360).
152195968 is an abundant number, since it is smaller than the sum of its proper divisors (182910752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152195968 is a wasteful number, since it uses less digits than its factorization.
152195968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3095 (or 3083 counting only the distinct ones).
The product of its digits is 194400, while the sum is 46.
The square root of 152195968 is about 12336.7729978305. The cubic root of 152195968 is about 533.9095827125.
The spelling of 152195968 in words is "one hundred fifty-two million, one hundred ninety-five thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •