Base | Representation |
---|---|
bin | 111001010110… |
… | …1011011101111 |
3 | 2002120201222122 |
4 | 1302231123233 |
5 | 30144224021 |
6 | 2552303155 |
7 | 513411062 |
oct | 162553357 |
9 | 62521878 |
10 | 30070511 |
11 | 15a79469 |
12 | a0a1abb |
13 | 62cb103 |
14 | 3dca8d9 |
15 | 298ebab |
hex | 1cad6ef |
30070511 has 4 divisors (see below), whose sum is σ = 30091224. Its totient is φ = 30049800.
The previous prime is 30070489. The next prime is 30070549. The reversal of 30070511 is 11507003.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30070511 is a prime.
It is a super-2 number, since 2×300705112 = 1808471263602242, 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 30070511.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30070561) 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, 8000 + ... + 11141.
It is an arithmetic number, because the mean of its divisors is an integer number (7522806).
Almost surely, 230070511 is an apocalyptic number.
30070511 is a deficient number, since it is larger than the sum of its proper divisors (20713).
30070511 is a wasteful number, since it uses less digits than its factorization.
30070511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20712.
The product of its (nonzero) digits is 105, while the sum is 17.
The square root of 30070511 is about 5483.6585415213. The cubic root of 30070511 is about 310.9664979782.
Adding to 30070511 its reverse (11507003), we get a palindrome (41577514).
The spelling of 30070511 in words is "thirty million, seventy thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •