Base | Representation |
---|---|
bin | 1000101111001101000… |
… | …0001101100111110010 |
3 | 112100110102110011202202 |
4 | 2023303100031213302 |
5 | 4424411130023100 |
6 | 152543134143202 |
7 | 13562602650530 |
oct | 2136320154762 |
9 | 470412404682 |
10 | 150110001650 |
11 | 58730201004 |
12 | 25113651b02 |
13 | 112032b54ab |
14 | 73a0227150 |
15 | 3d885ac7d5 |
hex | 22f340d9f2 |
150110001650 has 24 divisors (see below), whose sum is σ = 319090975680. Its totient is φ = 51466286160.
The previous prime is 150110001641. The next prime is 150110001667. The reversal of 150110001650 is 56100011051.
150110001650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1501100016503 (a number of 35 digits) contains 333 as substring.
It is a Curzon 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 11 ways as a sum of consecutive naturals, for example, 214442510 + ... + 214443209.
It is an arithmetic number, because the mean of its divisors is an integer number (13295457320).
Almost surely, 2150110001650 is an apocalyptic number.
150110001650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150110001650 is an abundant number, since it is smaller than the sum of its proper divisors (168980974030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150110001650 is a wasteful number, since it uses less digits than its factorization.
150110001650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428885738 (or 428885733 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 20.
The spelling of 150110001650 in words is "one hundred fifty billion, one hundred ten million, one thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •