Base | Representation |
---|---|
bin | 10010001100100… |
… | …11010001110000 |
3 | 101122020021000000 |
4 | 21012103101300 |
5 | 303034144033 |
6 | 23051430000 |
7 | 3532322211 |
oct | 1106232160 |
9 | 348207000 |
10 | 152646768 |
11 | 7918a85a |
12 | 43155300 |
13 | 25817841 |
14 | 163b7408 |
15 | d603a13 |
hex | 9193470 |
152646768 has 140 divisors (see below), whose sum is σ = 463519440. Its totient is φ = 48584448.
The previous prime is 152646751. The next prime is 152646773. The reversal of 152646768 is 867646251.
152646768 is a `hidden beast` number, since 1 + 526 + 4 + 67 + 68 = 666.
It is a congruent number.
It is an unprimeable number.
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 27 ways as a sum of consecutive naturals, for example, 267988 + ... + 268556.
Almost surely, 2152646768 is an apocalyptic number.
152646768 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 152646768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (231759720).
152646768 is an abundant number, since it is smaller than the sum of its proper divisors (310872672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152646768 is an equidigital number, since it uses as much as digits as its factorization.
152646768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 618 (or 597 counting only the distinct ones).
The product of its digits is 483840, while the sum is 45.
The square root of 152646768 is about 12355.0300687615. The cubic root of 152646768 is about 534.4362046240.
The spelling of 152646768 in words is "one hundred fifty-two million, six hundred forty-six thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •