Base | Representation |
---|---|
bin | 11100011110011100… |
… | …101010101011000101 |
3 | 2220220212101112101112 |
4 | 130132130222223011 |
5 | 1000104323233443 |
6 | 22013553134405 |
7 | 2131456221611 |
oct | 343634525305 |
9 | 86825345345 |
10 | 30575602373 |
11 | 11a70148678 |
12 | 5b1385a405 |
13 | 2b636caa14 |
14 | 16a0a80341 |
15 | bde427b18 |
hex | 71e72aac5 |
30575602373 has 2 divisors, whose sum is σ = 30575602374. Its totient is φ = 30575602372.
The previous prime is 30575602361. The next prime is 30575602397. The reversal of 30575602373 is 37320657503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20459869444 + 10115732929 = 143038^2 + 100577^2 .
It is a cyclic number.
It is not a de Polignac number, because 30575602373 - 222 = 30571408069 is a prime.
It is a super-2 number, since 2×305756023732 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30575602373.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30575202373) 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, 15287801186 + 15287801187.
It is an arithmetic number, because the mean of its divisors is an integer number (15287801187).
Almost surely, 230575602373 is an apocalyptic number.
It is an amenable number.
30575602373 is a deficient number, since it is larger than the sum of its proper divisors (1).
30575602373 is an equidigital number, since it uses as much as digits as its factorization.
30575602373 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 396900, while the sum is 41.
The spelling of 30575602373 in words is "thirty billion, five hundred seventy-five million, six hundred two thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •