Base | Representation |
---|---|
bin | 1000110100011011000… |
… | …0100110100000111110 |
3 | 112111002001200022210010 |
4 | 2031012300212200332 |
5 | 4440243304014100 |
6 | 153334142324050 |
7 | 13642404155265 |
oct | 2150660464076 |
9 | 474061608703 |
10 | 151511001150 |
11 | 5928a012733 |
12 | 25444889626 |
13 | 11397623b92 |
14 | 74943195dc |
15 | 3e1b59d750 |
hex | 2346c2683e |
151511001150 has 96 divisors (see below), whose sum is σ = 388110302208. Its totient is φ = 39075206400.
The previous prime is 151511001139. The next prime is 151511001163. The reversal of 151511001150 is 51100115151.
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 (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8142157 + ... + 8160743.
It is an arithmetic number, because the mean of its divisors is an integer number (4042815648).
Almost surely, 2151511001150 is an apocalyptic number.
151511001150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 151511001150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194055151104).
151511001150 is an abundant number, since it is smaller than the sum of its proper divisors (236599301058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151511001150 is a wasteful number, since it uses less digits than its factorization.
151511001150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20386 (or 20381 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 21.
The spelling of 151511001150 in words is "one hundred fifty-one billion, five hundred eleven million, one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •