Base | Representation |
---|---|
bin | 10010100011111… |
… | …00000000000000 |
3 | 101211222020100012 |
4 | 21101330000000 |
5 | 304324302102 |
6 | 23241044052 |
7 | 3600255362 |
oct | 1121740000 |
9 | 354866305 |
10 | 155697152 |
11 | 7a983636 |
12 | 44186628 |
13 | 263450c0 |
14 | 1696cd32 |
15 | da07752 |
hex | 947c000 |
155697152 has 120 divisors (see below), whose sum is σ = 363320496. Its totient is φ = 66060288.
The previous prime is 155697121. The next prime is 155697161. The reversal of 155697152 is 251796551.
155697152 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1556971522 = 48483206281822208, which contains 22 as substring.
Its product of digits (94500) is a multiple of the sum of its prime divisors (75).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3620843 + ... + 3620885.
Almost surely, 2155697152 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 155697152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181660248).
155697152 is an abundant number, since it is smaller than the sum of its proper divisors (207623344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
155697152 is an equidigital number, since it uses as much as digits as its factorization.
155697152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101 (or 75 counting only the distinct ones).
The product of its digits is 94500, while the sum is 41.
The square root of 155697152 is about 12477.8664842993. The cubic root of 155697152 is about 537.9726818723.
The spelling of 155697152 in words is "one hundred fifty-five million, six hundred ninety-seven thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •