Base | Representation |
---|---|
bin | 10010000100110… |
… | …01101111011100 |
3 | 101120022022221110 |
4 | 21002121233130 |
5 | 302303442133 |
6 | 23013502020 |
7 | 3520534266 |
oct | 1102315734 |
9 | 346268843 |
10 | 151624668 |
11 | 78651948 |
12 | 42941910 |
13 | 2554a550 |
14 | 161ccb36 |
15 | d4a0c63 |
hex | 9099bdc |
151624668 has 96 divisors (see below), whose sum is σ = 396531520. Its totient is φ = 44789760.
The previous prime is 151624651. The next prime is 151624691. The reversal of 151624668 is 866426151.
It is a happy number.
151624668 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1516246682 = 45980079892220448, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 629028 + ... + 629268.
Almost surely, 2151624668 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 151624668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (198265760).
151624668 is an abundant number, since it is smaller than the sum of its proper divisors (244906852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151624668 is a wasteful number, since it uses less digits than its factorization.
151624668 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407 (or 405 counting only the distinct ones).
The product of its digits is 69120, while the sum is 39.
The square root of 151624668 is about 12313.5968749996. The cubic root of 151624668 is about 533.2406972788.
The spelling of 151624668 in words is "one hundred fifty-one million, six hundred twenty-four thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •