Base | Representation |
---|---|
bin | 10010011101110… |
… | …10111000101000 |
3 | 101210111001021220 |
4 | 21032322320220 |
5 | 304123444102 |
6 | 23212102040 |
7 | 3560452302 |
oct | 1116727050 |
9 | 353431256 |
10 | 154906152 |
11 | 7a493315 |
12 | 43a64920 |
13 | 2612905b |
14 | 16804972 |
15 | d8ed1bc |
hex | 93bae28 |
154906152 has 32 divisors (see below), whose sum is σ = 393832800. Its totient is φ = 50759744.
The previous prime is 154906151. The next prime is 154906201. The reversal of 154906152 is 251609451.
154906152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (154906151) 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, 53283 + ... + 56114.
It is an arithmetic number, because the mean of its divisors is an integer number (12307275).
Almost surely, 2154906152 is an apocalyptic number.
154906152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
154906152 is an abundant number, since it is smaller than the sum of its proper divisors (238926648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
154906152 is a wasteful number, since it uses less digits than its factorization.
154906152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109465 (or 109461 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 33.
The square root of 154906152 is about 12446.1300009280. The cubic root of 154906152 is about 537.0601002891.
The spelling of 154906152 in words is "one hundred fifty-four million, nine hundred six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •