Base | Representation |
---|---|
bin | 111001100000… |
… | …0111110001000 |
3 | 2002201210202112 |
4 | 1303000332020 |
5 | 30204304121 |
6 | 2554121452 |
7 | 514163303 |
oct | 163007610 |
9 | 62653675 |
10 | 30150536 |
11 | 160235a9 |
12 | a120288 |
13 | 6328670 |
14 | 400bb3a |
15 | 29a875b |
hex | 1cc0f88 |
30150536 has 32 divisors (see below), whose sum is σ = 61803840. Its totient is φ = 13704768.
The previous prime is 30150509. The next prime is 30150551. The reversal of 30150536 is 63505103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4805 + ... + 9131.
It is an arithmetic number, because the mean of its divisors is an integer number (1931370).
Almost surely, 230150536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 30150536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30901920).
30150536 is an abundant number, since it is smaller than the sum of its proper divisors (31653304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
30150536 is a wasteful number, since it uses less digits than its factorization.
30150536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4413 (or 4409 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 23.
The square root of 30150536 is about 5490.9503731139. The cubic root of 30150536 is about 311.2421063250.
Adding to 30150536 its reverse (63505103), we get a palindrome (93655639).
It can be divided in two parts, 30150 and 536, that multiplied together give a square (16160400 = 40202).
The spelling of 30150536 in words is "thirty million, one hundred fifty thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •