Base | Representation |
---|---|
bin | 1000110010111011101… |
… | …1010010100111100010 |
3 | 112110001012021210012010 |
4 | 2030232323102213202 |
5 | 4433433423300200 |
6 | 153230340213350 |
7 | 13626450403530 |
oct | 2145673224742 |
9 | 473035253163 |
10 | 151111150050 |
11 | 590a4339683 |
12 | 2535299a256 |
13 | 113328352b3 |
14 | 7457193150 |
15 | 3de6419150 |
hex | 232eed29e2 |
151111150050 has 96 divisors (see below), whose sum is σ = 428493146112. Its totient is φ = 34523484480.
The previous prime is 151111150049. The next prime is 151111150061. The reversal of 151111150050 is 50051111151.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 151111149999 and 151111150026.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2280487 + ... + 2345813.
It is an arithmetic number, because the mean of its divisors is an integer number (4463470272).
Almost surely, 2151111150050 is an apocalyptic number.
151111150050 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 151111150050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214246573056).
151111150050 is an abundant number, since it is smaller than the sum of its proper divisors (277381996062).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151111150050 is a wasteful number, since it uses less digits than its factorization.
151111150050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67552 (or 67547 counting only the distinct ones).
The product of its (nonzero) digits is 125, while the sum is 21.
The spelling of 151111150050 in words is "one hundred fifty-one billion, one hundred eleven million, one hundred fifty thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •