Base | Representation |
---|---|
bin | 1001010100010000011… |
… | …1000101111110110110 |
3 | 120022010121112122122002 |
4 | 2111010013011332312 |
5 | 10110243431001100 |
6 | 201310130135302 |
7 | 14364230542451 |
oct | 2250407057666 |
9 | 508117478562 |
10 | 160056500150 |
11 | 619747a35a8 |
12 | 2702a721532 |
13 | 12129b8c871 |
14 | 7a65220498 |
15 | 426b8ed2d5 |
hex | 25441c5fb6 |
160056500150 has 48 divisors (see below), whose sum is σ = 304169817600. Its totient is φ = 62633508000.
The previous prime is 160056500101. The next prime is 160056500161. The reversal of 160056500150 is 51005650061.
160056500150 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5981501 + ... + 6008199.
It is an arithmetic number, because the mean of its divisors is an integer number (6336871200).
Almost surely, 2160056500150 is an apocalyptic number.
160056500150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
160056500150 is a deficient number, since it is larger than the sum of its proper divisors (144113317450).
160056500150 is a wasteful number, since it uses less digits than its factorization.
160056500150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29309 (or 29304 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 160056500150 in words is "one hundred sixty billion, fifty-six million, five hundred thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •