Base | Representation |
---|---|
bin | 11100011010010010… |
… | …011011101111010001 |
3 | 2220202000001202111001 |
4 | 130122102123233101 |
5 | 444433441422042 |
6 | 22003021222001 |
7 | 2126651054122 |
oct | 343222335721 |
9 | 86660052431 |
10 | 30505810897 |
11 | 11a3480a271 |
12 | 5ab4401901 |
13 | 2b521030a3 |
14 | 16956b4049 |
15 | bd823dbb7 |
hex | 71a49bbd1 |
30505810897 has 4 divisors (see below), whose sum is σ = 30510452916. Its totient is φ = 30501168880.
The previous prime is 30505810883. The next prime is 30505810913. The reversal of 30505810897 is 79801850503.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 79801850503 = 1663 ⋅47986681.
It can be written as a sum of positive squares in 2 ways, for example, as 2495102401 + 28010708496 = 49951^2 + 167364^2 .
It is a cyclic number.
It is not a de Polignac number, because 30505810897 - 227 = 30371593169 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30505810807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2311138 + ... + 2324299.
It is an arithmetic number, because the mean of its divisors is an integer number (7627613229).
Almost surely, 230505810897 is an apocalyptic number.
It is an amenable number.
30505810897 is a deficient number, since it is larger than the sum of its proper divisors (4642019).
30505810897 is an equidigital number, since it uses as much as digits as its factorization.
30505810897 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4642018.
The product of its (nonzero) digits is 302400, while the sum is 46.
The spelling of 30505810897 in words is "thirty billion, five hundred five million, eight hundred ten thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •