Base | Representation |
---|---|
bin | 1000101111111111000… |
… | …0110110110111110100 |
3 | 112101000001101101201020 |
4 | 2023333300312313310 |
5 | 4430323342321222 |
6 | 153020032501140 |
7 | 13601031642645 |
oct | 2137760666764 |
9 | 471001341636 |
10 | 150319885812 |
11 | 58828725098 |
12 | 251719aa7b0 |
13 | 112379206c5 |
14 | 73c005d6cc |
15 | 3d9bc1a65c |
hex | 22ffc36df4 |
150319885812 has 12 divisors (see below), whose sum is σ = 350746400256. Its totient is φ = 50106628600.
The previous prime is 150319885811. The next prime is 150319885813. The reversal of 150319885812 is 218588913051.
It is an interprime number because it is at equal distance from previous prime (150319885811) and next prime (150319885813).
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150319885811) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6263328564 + ... + 6263328587.
It is an arithmetic number, because the mean of its divisors is an integer number (29228866688).
Almost surely, 2150319885812 is an apocalyptic number.
150319885812 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
150319885812 is an abundant number, since it is smaller than the sum of its proper divisors (200426514444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150319885812 is a wasteful number, since it uses less digits than its factorization.
150319885812 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12526657158 (or 12526657156 counting only the distinct ones).
The product of its (nonzero) digits is 691200, while the sum is 51.
The spelling of 150319885812 in words is "one hundred fifty billion, three hundred nineteen million, eight hundred eighty-five thousand, eight hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •