Base | Representation |
---|---|
bin | 1101111000001001001111… |
… | …00100101000001000000001 |
3 | 11000001100011211201121201012 |
4 | 12330010213210220020001 |
5 | 12444440100034113131 |
6 | 144523013231450305 |
7 | 6266511000554105 |
oct | 674044744501001 |
9 | 130040154647635 |
10 | 30516406551041 |
11 | 97a5a31a34144 |
12 | 350a34a986995 |
13 | 14048b9639598 |
14 | 77700552d905 |
15 | 37dc05e5c52b |
hex | 1bc127928201 |
30516406551041 has 2 divisors, whose sum is σ = 30516406551042. Its totient is φ = 30516406551040.
The previous prime is 30516406551011. The next prime is 30516406551053. The reversal of 30516406551041 is 14015560461503.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30515912822641 + 493728400 = 5524121^2 + 22220^2 .
It is a cyclic number.
It is not a de Polignac number, because 30516406551041 - 234 = 30499226681857 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30516406551041.
It is not a weakly prime, because it can be changed into another prime (30516406551011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15258203275520 + 15258203275521.
It is an arithmetic number, because the mean of its divisors is an integer number (15258203275521).
Almost surely, 230516406551041 is an apocalyptic number.
It is an amenable number.
30516406551041 is a deficient number, since it is larger than the sum of its proper divisors (1).
30516406551041 is an equidigital number, since it uses as much as digits as its factorization.
30516406551041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216000, while the sum is 41.
The spelling of 30516406551041 in words is "thirty trillion, five hundred sixteen billion, four hundred six million, five hundred fifty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •