Base | Representation |
---|---|
bin | 1000110000110111101… |
… | …1111001011000100000 |
3 | 112101121121210121112201 |
4 | 2030031323321120200 |
5 | 4431320230120304 |
6 | 153055405102544 |
7 | 13606650000133 |
oct | 2141573713040 |
9 | 471547717481 |
10 | 150557660704 |
11 | 5893a968970 |
12 | 25219557a54 |
13 | 11274c727c9 |
14 | 740387621a |
15 | 3db2a373a4 |
hex | 230def9620 |
150557660704 has 96 divisors (see below), whose sum is σ = 340896076416. Its totient is φ = 64784670720.
The previous prime is 150557660689. The next prime is 150557660719. The reversal of 150557660704 is 407066755051.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (150557660689) and next prime (150557660719).
It is a Harshad number since it is a multiple of its sum of digits (46).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 689454 + ... + 881170.
It is an arithmetic number, because the mean of its divisors is an integer number (3551000796).
Almost surely, 2150557660704 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 150557660704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170448038208).
150557660704 is an abundant number, since it is smaller than the sum of its proper divisors (190338415712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150557660704 is a wasteful number, since it uses less digits than its factorization.
150557660704 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191858 (or 191850 counting only the distinct ones).
The product of its (nonzero) digits is 882000, while the sum is 46.
The spelling of 150557660704 in words is "one hundred fifty billion, five hundred fifty-seven million, six hundred sixty thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •