Base | Representation |
---|---|
bin | 11100010111101001… |
… | …001101100101001101 |
3 | 2220121220121000120002 |
4 | 130113221031211031 |
5 | 444341112404243 |
6 | 21554354334045 |
7 | 2125602025541 |
oct | 342751154515 |
9 | 86556530502 |
10 | 30461450573 |
11 | 11a11770744 |
12 | 5aa158a325 |
13 | 2b45b70988 |
14 | 168d847a21 |
15 | bd43c9eb8 |
hex | 717a4d94d |
30461450573 has 2 divisors, whose sum is σ = 30461450574. Its totient is φ = 30461450572.
The previous prime is 30461450519. The next prime is 30461450587. The reversal of 30461450573 is 37505416403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27160028809 + 3301421764 = 164803^2 + 57458^2 .
It is a cyclic number.
It is not a de Polignac number, because 30461450573 - 226 = 30394341709 is a prime.
It is a super-2 number, since 2×304614505732 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30461452573) 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 as a sum of consecutive naturals, namely, 15230725286 + 15230725287.
It is an arithmetic number, because the mean of its divisors is an integer number (15230725287).
Almost surely, 230461450573 is an apocalyptic number.
It is an amenable number.
30461450573 is a deficient number, since it is larger than the sum of its proper divisors (1).
30461450573 is an equidigital number, since it uses as much as digits as its factorization.
30461450573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 38.
Adding to 30461450573 its reverse (37505416403), we get a palindrome (67966866976).
The spelling of 30461450573 in words is "thirty billion, four hundred sixty-one million, four hundred fifty thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •