Base | Representation |
---|---|
bin | 11100010001001010… |
… | …100110000010001001 |
3 | 2220100100002000110012 |
4 | 130101022212002021 |
5 | 444130301322334 |
6 | 21535513001305 |
7 | 2123112132326 |
oct | 342112460211 |
9 | 86310060405 |
10 | 30352760969 |
11 | 11966384623 |
12 | 5a710b3235 |
13 | 2b294a6bbb |
14 | 167d233b4d |
15 | bc9aaa9ce |
hex | 7112a6089 |
30352760969 has 2 divisors, whose sum is σ = 30352760970. Its totient is φ = 30352760968.
The previous prime is 30352760953. The next prime is 30352761059. The reversal of 30352760969 is 96906725303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30157795600 + 194965369 = 173660^2 + 13963^2 .
It is an emirp because it is prime and its reverse (96906725303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30352760969 - 24 = 30352760953 is a prime.
It is a super-2 number, since 2×303527609692 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (30352760909) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15176380484 + 15176380485.
It is an arithmetic number, because the mean of its divisors is an integer number (15176380485).
Almost surely, 230352760969 is an apocalyptic number.
It is an amenable number.
30352760969 is a deficient number, since it is larger than the sum of its proper divisors (1).
30352760969 is an equidigital number, since it uses as much as digits as its factorization.
30352760969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1837080, while the sum is 50.
The spelling of 30352760969 in words is "thirty billion, three hundred fifty-two million, seven hundred sixty thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •