Base | Representation |
---|---|
bin | 1000110001111111110… |
… | …1001101100110000000 |
3 | 112102101200200210221111 |
4 | 2030133331031212000 |
5 | 4432430124324040 |
6 | 153145405133104 |
7 | 13620310542553 |
oct | 2143775154600 |
9 | 472350623844 |
10 | 150859995520 |
11 | 58a85597553 |
12 | 252a285a194 |
13 | 112c27aa250 |
14 | 7431a9669a |
15 | 3dce357dea |
hex | 231ff4d980 |
150859995520 has 128 divisors (see below), whose sum is σ = 405279080640. Its totient is φ = 53280251904.
The previous prime is 150859995491. The next prime is 150859995521. The reversal of 150859995520 is 25599958051.
150859995520 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150859995521) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 202819 + ... + 585538.
Almost surely, 2150859995520 is an apocalyptic number.
150859995520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
150859995520 is an abundant number, since it is smaller than the sum of its proper divisors (254419085120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150859995520 is a wasteful number, since it uses less digits than its factorization.
150859995520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 788412 (or 788400 counting only the distinct ones).
The product of its (nonzero) digits is 7290000, while the sum is 58.
The spelling of 150859995520 in words is "one hundred fifty billion, eight hundred fifty-nine million, nine hundred ninety-five thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •