Base | Representation |
---|---|
bin | 111001110000… |
… | …0101111101001 |
3 | 2002222102021201 |
4 | 1303200233221 |
5 | 30222440211 |
6 | 3001004201 |
7 | 515244604 |
oct | 163405751 |
9 | 62872251 |
10 | 30280681 |
11 | 16102362 |
12 | a183661 |
13 | 6372982 |
14 | 404333b |
15 | 29d20c1 |
hex | 1ce0be9 |
30280681 has 4 divisors (see below), whose sum is σ = 30324100. Its totient is φ = 30237264.
The previous prime is 30280651. The next prime is 30280687. The reversal of 30280681 is 18608203.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 18608203 = 1301 ⋅14303.
It can be written as a sum of positive squares in 2 ways, for example, as 5480281 + 24800400 = 2341^2 + 4980^2 .
It is a cyclic number.
It is not a de Polignac number, because 30280681 - 29 = 30280169 is a prime.
It is a super-2 number, since 2×302806812 = 1833839283647522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30280687) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20646 + ... + 22063.
It is an arithmetic number, because the mean of its divisors is an integer number (7581025).
Almost surely, 230280681 is an apocalyptic number.
It is an amenable number.
30280681 is a deficient number, since it is larger than the sum of its proper divisors (43419).
30280681 is an equidigital number, since it uses as much as digits as its factorization.
30280681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43418.
The product of its (nonzero) digits is 2304, while the sum is 28.
The square root of 30280681 is about 5502.7884749461. The cubic root of 30280681 is about 311.6892897619.
Adding to 30280681 its reverse (18608203), we get a palindrome (48888884).
The spelling of 30280681 in words is "thirty million, two hundred eighty thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •