Base | Representation |
---|---|
bin | 111001100000… |
… | …0111101001011 |
3 | 2002201210200021 |
4 | 1303000331023 |
5 | 30204303400 |
6 | 2554121311 |
7 | 514163155 |
oct | 163007513 |
9 | 62653607 |
10 | 30150475 |
11 | 16023553 |
12 | a120237 |
13 | 6328624 |
14 | 400bad5 |
15 | 29a871a |
hex | 1cc0f4b |
30150475 has 12 divisors (see below), whose sum is σ = 38022120. Its totient is φ = 23710400.
The previous prime is 30150467. The next prime is 30150479. The reversal of 30150475 is 57405103.
It is not a de Polignac number, because 30150475 - 23 = 30150467 is a prime.
It is a super-2 number, since 2×301504752 = 1818102285451250, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (30150479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8746 + ... + 11695.
It is an arithmetic number, because the mean of its divisors is an integer number (3168510).
Almost surely, 230150475 is an apocalyptic number.
30150475 is a deficient number, since it is larger than the sum of its proper divisors (7871645).
30150475 is a wasteful number, since it uses less digits than its factorization.
30150475 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20510 (or 20505 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 25.
The square root of 30150475 is about 5490.9448185171. The cubic root of 30150475 is about 311.2418964251.
Adding to 30150475 its reverse (57405103), we get a palindrome (87555578).
It can be divided in two parts, 30150 and 475, that added together give a square (30625 = 1752).
The spelling of 30150475 in words is "thirty million, one hundred fifty thousand, four hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •