Base | Representation |
---|---|
bin | 111010001110… |
… | …0011101111111 |
3 | 2010102211212002 |
4 | 1310130131333 |
5 | 30303302221 |
6 | 3010132515 |
7 | 520314035 |
oct | 164343577 |
9 | 63384762 |
10 | 30525311 |
11 | 1625a133 |
12 | a28113b |
13 | 642a11b |
14 | 40a8555 |
15 | 2a2e80b |
hex | 1d1c77f |
30525311 has 4 divisors (see below), whose sum is σ = 30634224. Its totient is φ = 30416400.
The previous prime is 30525293. The next prime is 30525367. The reversal of 30525311 is 11352503.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11352503 = 383 ⋅29641.
It is a cyclic number.
It is not a de Polignac number, because 30525311 - 26 = 30525247 is a prime.
It is a super-2 number, since 2×305253112 = 1863589223293442, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30525211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54035 + ... + 54596.
It is an arithmetic number, because the mean of its divisors is an integer number (7658556).
Almost surely, 230525311 is an apocalyptic number.
30525311 is a deficient number, since it is larger than the sum of its proper divisors (108913).
30525311 is a wasteful number, since it uses less digits than its factorization.
30525311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108912.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 30525311 is about 5524.9715836373. The cubic root of 30525311 is about 312.5263926509.
Adding to 30525311 its reverse (11352503), we get a palindrome (41877814).
The spelling of 30525311 in words is "thirty million, five hundred twenty-five thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •