Base | Representation |
---|---|
bin | 111001010100… |
… | …1000110101101 |
3 | 2002112211122222 |
4 | 1302221012231 |
5 | 30143142111 |
6 | 2552045125 |
7 | 513305303 |
oct | 162510655 |
9 | 62484588 |
10 | 30052781 |
11 | 15a67110 |
12 | a0937a5 |
13 | 62c3015 |
14 | 3dc4273 |
15 | 29897db |
hex | 1ca91ad |
30052781 has 8 divisors (see below), whose sum is σ = 32952000. Its totient is φ = 27181440.
The previous prime is 30052751. The next prime is 30052807. The reversal of 30052781 is 18725003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 30052781 - 210 = 30051757 is a prime.
It is a super-2 number, since 2×300527812 = 1806339291667922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 30052781.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30052721) 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 7 ways as a sum of consecutive naturals, for example, 4676 + ... + 9053.
It is an arithmetic number, because the mean of its divisors is an integer number (4119000).
Almost surely, 230052781 is an apocalyptic number.
It is an amenable number.
30052781 is a deficient number, since it is larger than the sum of its proper divisors (2899219).
30052781 is a wasteful number, since it uses less digits than its factorization.
30052781 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13939.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 30052781 is about 5482.0416817095. The cubic root of 30052781 is about 310.9053692092.
Adding to 30052781 its reverse (18725003), we get a palindrome (48777784).
The spelling of 30052781 in words is "thirty million, fifty-two thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •