Base | Representation |
---|---|
bin | 1101111001001101011010… |
… | …00001110010001111010101 |
3 | 11000011211122110201211200102 |
4 | 12330212231001302033111 |
5 | 13001040023324141431 |
6 | 144551505030023445 |
7 | 6302244645041105 |
oct | 674465501621725 |
9 | 130154573654612 |
10 | 30553005302741 |
11 | 980a502a83a79 |
12 | 35154637a7b85 |
13 | 140819cb49a8c |
14 | 778ab80c7205 |
15 | 37eb49041dcb |
hex | 1bc9ad0723d5 |
30553005302741 has 2 divisors, whose sum is σ = 30553005302742. Its totient is φ = 30553005302740.
The previous prime is 30553005302719. The next prime is 30553005302753. The reversal of 30553005302741 is 14720350035503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28941667024516 + 1611338278225 = 5379746^2 + 1269385^2 .
It is a cyclic number.
It is not a de Polignac number, because 30553005302741 - 214 = 30553005286357 is a prime.
It is a super-2 number, since 2×305530053027412 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30553005302695 and 30553005302704.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30553005302791) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15276502651370 + 15276502651371.
It is an arithmetic number, because the mean of its divisors is an integer number (15276502651371).
Almost surely, 230553005302741 is an apocalyptic number.
It is an amenable number.
30553005302741 is a deficient number, since it is larger than the sum of its proper divisors (1).
30553005302741 is an equidigital number, since it uses as much as digits as its factorization.
30553005302741 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 189000, while the sum is 38.
The spelling of 30553005302741 in words is "thirty trillion, five hundred fifty-three billion, five million, three hundred two thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •