Base | Representation |
---|---|
bin | 10010000100000… |
… | …00010111000010 |
3 | 101120010001100000 |
4 | 21002000113002 |
5 | 302242130311 |
6 | 23011340430 |
7 | 3516622221 |
oct | 1102002702 |
9 | 346101300 |
10 | 151520706 |
11 | 78590827 |
12 | 428b1716 |
13 | 2551212c |
14 | 161a2cb8 |
15 | d480056 |
hex | 90805c2 |
151520706 has 96 divisors (see below), whose sum is σ = 365601600. Its totient is φ = 46889280.
The previous prime is 151520671. The next prime is 151520713. The reversal of 151520706 is 607025151.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 151520706.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 563140 + ... + 563408.
It is an arithmetic number, because the mean of its divisors is an integer number (3808350).
Almost surely, 2151520706 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 151520706, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (182800800).
151520706 is an abundant number, since it is smaller than the sum of its proper divisors (214080894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151520706 is a wasteful number, since it uses less digits than its factorization.
151520706 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 366 (or 354 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The square root of 151520706 is about 12309.3747201066. The cubic root of 151520706 is about 533.1187966121.
Adding to 151520706 its reverse (607025151), we get a palindrome (758545857).
The spelling of 151520706 in words is "one hundred fifty-one million, five hundred twenty thousand, seven hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •