Base | Representation |
---|---|
bin | 111001101100… |
… | …1000100101101 |
3 | 2002220211012000 |
4 | 1303121010231 |
5 | 30220434021 |
6 | 3000202513 |
7 | 515054160 |
oct | 163310455 |
9 | 62824160 |
10 | 30249261 |
11 | 16090799 |
12 | a169439 |
13 | 6361593 |
14 | 4035ad7 |
15 | 29c7b26 |
hex | 1cd912d |
30249261 has 16 divisors (see below), whose sum is σ = 51216000. Its totient is φ = 17285184.
The previous prime is 30249257. The next prime is 30249283. The reversal of 30249261 is 16294203.
It is not a de Polignac number, because 30249261 - 22 = 30249257 is a prime.
It is a super-2 number, since 2×302492612 = 1830035582092242, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30249251) 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 15 ways as a sum of consecutive naturals, for example, 79836 + ... + 80213.
It is an arithmetic number, because the mean of its divisors is an integer number (3201000).
Almost surely, 230249261 is an apocalyptic number.
It is an amenable number.
30249261 is a deficient number, since it is larger than the sum of its proper divisors (20966739).
30249261 is a wasteful number, since it uses less digits than its factorization.
30249261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 160065 (or 160059 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 30249261 is about 5499.9328177715. The cubic root of 30249261 is about 311.5814468913.
It can be divided in two parts, 3024 and 9261, that multiplied together give a square (28005264 = 52922).
The spelling of 30249261 in words is "thirty million, two hundred forty-nine thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •