Base | Representation |
---|---|
bin | 111000000001001110… |
… | …000100000101110111 |
3 | 12202020221211220111000 |
4 | 320001032010011313 |
5 | 1441141400144020 |
6 | 43344343214343 |
7 | 4226400421242 |
oct | 700116040567 |
9 | 182227756430 |
10 | 60150006135 |
11 | 2356712397a |
12 | b7a81473b3 |
13 | 589785bb0b |
14 | 2ca8780259 |
15 | 18709d4090 |
hex | e01384177 |
60150006135 has 64 divisors (see below), whose sum is σ = 114818549760. Its totient is φ = 29767610880.
The previous prime is 60150006131. The next prime is 60150006139. The reversal of 60150006135 is 53160005106.
It is a happy number.
60150006135 is a `hidden beast` number, since 601 + 50 + 0 + 0 + 6 + 1 + 3 + 5 = 666.
It is an interprime number because it is at equal distance from previous prime (60150006131) and next prime (60150006139).
It is not a de Polignac number, because 60150006135 - 22 = 60150006131 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 60150006099 and 60150006108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60150006131) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 21627 + ... + 347516.
It is an arithmetic number, because the mean of its divisors is an integer number (1794039840).
Almost surely, 260150006135 is an apocalyptic number.
60150006135 is a deficient number, since it is larger than the sum of its proper divisors (54668543625).
60150006135 is a wasteful number, since it uses less digits than its factorization.
60150006135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 369245 (or 369239 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The spelling of 60150006135 in words is "sixty billion, one hundred fifty million, six thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •