Base | Representation |
---|---|
bin | 10010001101000… |
… | …01110110001100 |
3 | 101122100021212020 |
4 | 21012201312030 |
5 | 303043101234 |
6 | 23053010140 |
7 | 3532661202 |
oct | 1106416614 |
9 | 348307766 |
10 | 152706444 |
11 | 79220680 |
12 | 43183950 |
13 | 25838a57 |
14 | 163d1072 |
15 | d616549 |
hex | 91a1d8c |
152706444 has 72 divisors (see below), whose sum is σ = 413020608. Its totient is φ = 43541760.
The previous prime is 152706443. The next prime is 152706457. The reversal of 152706444 is 444607251.
152706444 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (152706443) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36147 + ... + 40149.
Almost surely, 2152706444 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 152706444, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (206510304).
152706444 is an abundant number, since it is smaller than the sum of its proper divisors (260314164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
152706444 is a wasteful number, since it uses less digits than its factorization.
152706444 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4055 (or 4036 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 33.
The square root of 152706444 is about 12357.4448815279. Note that the first 3 decimals coincide. The cubic root of 152706444 is about 534.5058400317.
The spelling of 152706444 in words is "one hundred fifty-two million, seven hundred six thousand, four hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •