Base | Representation |
---|---|
bin | 1000110100110000100… |
… | …0001011000010100110 |
3 | 112111022100011002201212 |
4 | 2031030020023002212 |
5 | 4440434333104100 |
6 | 153351120551422 |
7 | 13644546541412 |
oct | 2151410130246 |
9 | 474270132655 |
10 | 151601066150 |
11 | 59325938916 |
12 | 2546aa82572 |
13 | 113b0199591 |
14 | 74a2281d42 |
15 | 3e2443e635 |
hex | 234c20b0a6 |
151601066150 has 12 divisors (see below), whose sum is σ = 281977983132. Its totient is φ = 60640426440.
The previous prime is 151601066143. The next prime is 151601066161. The reversal of 151601066150 is 51660106151.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1516010612 + ... + 1516010711.
It is an arithmetic number, because the mean of its divisors is an integer number (23498165261).
Almost surely, 2151601066150 is an apocalyptic number.
151601066150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
151601066150 is a deficient number, since it is larger than the sum of its proper divisors (130376916982).
151601066150 is a wasteful number, since it uses less digits than its factorization.
151601066150 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3032021335 (or 3032021330 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 32.
The spelling of 151601066150 in words is "one hundred fifty-one billion, six hundred one million, sixty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •