Base | Representation |
---|---|
bin | 1000110110101101110… |
… | …0101010001100011010 |
3 | 112112122221220110002011 |
4 | 2031223130222030122 |
5 | 4443023342432310 |
6 | 153515211300134 |
7 | 13663560113065 |
oct | 2155334521432 |
9 | 475587813064 |
10 | 152126530330 |
11 | 59575507935 |
12 | 25596a4a64a |
13 | 11464cc8c28 |
14 | 7511d858dc |
15 | 3e5563778a |
hex | 236b72a31a |
152126530330 has 64 divisors (see below), whose sum is σ = 286155555840. Its totient is φ = 58164019200.
The previous prime is 152126530279. The next prime is 152126530331. The reversal of 152126530330 is 33035621251.
152126530330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a junction number, because it is equal to n+sod(n) for n = 152126530292 and 152126530301.
It is not an unprimeable number, because it can be changed into a prime (152126530331) 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, 8479770 + ... + 8497690.
It is an arithmetic number, because the mean of its divisors is an integer number (4471180560).
Almost surely, 2152126530330 is an apocalyptic number.
152126530330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
152126530330 is a deficient number, since it is larger than the sum of its proper divisors (134029025510).
152126530330 is a wasteful number, since it uses less digits than its factorization.
152126530330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18295.
The product of its (nonzero) digits is 16200, while the sum is 31.
The spelling of 152126530330 in words is "one hundred fifty-two billion, one hundred twenty-six million, five hundred thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •