Base | Representation |
---|---|
bin | 1101110110010011110001… |
… | …10100011100001010000001 |
3 | 10222211022101222120002101212 |
4 | 12323021320310130022001 |
5 | 12442421422324011002 |
6 | 144434023522535505 |
7 | 6262116165455564 |
oct | 673117064341201 |
9 | 128738358502355 |
10 | 30453345141377 |
11 | 9781211462754 |
12 | 34ba08b807595 |
13 | 13cb9798763b2 |
14 | 773d4224a4db |
15 | 37c264a85352 |
hex | 1bb278d1c281 |
30453345141377 has 2 divisors, whose sum is σ = 30453345141378. Its totient is φ = 30453345141376.
The previous prime is 30453345141371. The next prime is 30453345141431. The reversal of 30453345141377 is 77314154335403.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19307622673936 + 11145722467441 = 4394044^2 + 3338521^2 .
It is an emirp because it is prime and its reverse (77314154335403) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30453345141377 - 228 = 30453076705921 is a prime.
It is a super-2 number, since 2×304533451413772 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30453345141371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15226672570688 + 15226672570689.
It is an arithmetic number, because the mean of its divisors is an integer number (15226672570689).
Almost surely, 230453345141377 is an apocalyptic number.
It is an amenable number.
30453345141377 is a deficient number, since it is larger than the sum of its proper divisors (1).
30453345141377 is an equidigital number, since it uses as much as digits as its factorization.
30453345141377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6350400, while the sum is 50.
The spelling of 30453345141377 in words is "thirty trillion, four hundred fifty-three billion, three hundred forty-five million, one hundred forty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •