Base | Representation |
---|---|
bin | 1000101110110011100… |
… | …0000011001001111110 |
3 | 112100011222010010121221 |
4 | 2023230320003021332 |
5 | 4424201232112110 |
6 | 152524352543554 |
7 | 13560133332235 |
oct | 2135470031176 |
9 | 470158103557 |
10 | 150003004030 |
11 | 58685870120 |
12 | 250a3851bba |
13 | 111b70918a9 |
14 | 738dd33b1c |
15 | 3d7dec47da |
hex | 22ece0327e |
150003004030 has 32 divisors (see below), whose sum is σ = 295724919168. Its totient is φ = 54329220000.
The previous prime is 150003004009. The next prime is 150003004033. The reversal of 150003004030 is 30400300051.
150003004030 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 = 150003003995 and 150003004013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (150003004033) 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, 2688852 + ... + 2744071.
It is an arithmetic number, because the mean of its divisors is an integer number (9241403724).
Almost surely, 2150003004030 is an apocalyptic number.
150003004030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
150003004030 is a deficient number, since it is larger than the sum of its proper divisors (145721915138).
150003004030 is a wasteful number, since it uses less digits than its factorization.
150003004030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5433192.
The product of its (nonzero) digits is 180, while the sum is 16.
Adding to 150003004030 its reverse (30400300051), we get a palindrome (180403304081).
The spelling of 150003004030 in words is "one hundred fifty billion, three million, four thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •