Base | Representation |
---|---|
bin | 1000101111010000101… |
… | …1100010010111101010 |
3 | 112100111111201021101111 |
4 | 2023310023202113222 |
5 | 4424424120200010 |
6 | 152544451340534 |
7 | 13563152101240 |
oct | 2136413422752 |
9 | 470444637344 |
10 | 150125553130 |
11 | 58738a63073 |
12 | 251188b174a |
13 | 1120659bb57 |
14 | 73a2314790 |
15 | 3d89b3058a |
hex | 22f42e25ea |
150125553130 has 64 divisors (see below), whose sum is σ = 327064158720. Its totient is φ = 48433803264.
The previous prime is 150125553107. The next prime is 150125553131. The reversal of 150125553130 is 31355521051.
150125553130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 150125553092 and 150125553101.
It is not an unprimeable number, because it can be changed into a prime (150125553131) 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 31 ways as a sum of consecutive naturals, for example, 7538226 + ... + 7558114.
It is an arithmetic number, because the mean of its divisors is an integer number (5110377480).
Almost surely, 2150125553130 is an apocalyptic number.
150125553130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150125553130 is an abundant number, since it is smaller than the sum of its proper divisors (176938605590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
150125553130 is a wasteful number, since it uses less digits than its factorization.
150125553130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26263.
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 150125553130 in words is "one hundred fifty billion, one hundred twenty-five million, five hundred fifty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •