Base | Representation |
---|---|
bin | 100111000010111011110… |
… | …1001100000101001110111 |
3 | 201000000200010212010112001 |
4 | 1032011313221200221313 |
5 | 1200410412402214223 |
6 | 15225144445240131 |
7 | 1062465633214006 |
oct | 116056751405167 |
9 | 21000603763461 |
10 | 5366421523063 |
11 | 1789983058177 |
12 | 72806b863047 |
13 | 2cc088b54b33 |
14 | 147a44154c3d |
15 | 948d62819ad |
hex | 4e177a60a77 |
5366421523063 has 2 divisors, whose sum is σ = 5366421523064. Its totient is φ = 5366421523062.
The previous prime is 5366421523033. The next prime is 5366421523079. The reversal of 5366421523063 is 3603251246635.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5366421523063 - 225 = 5366387968631 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5366421523003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2683210761531 + 2683210761532.
It is an arithmetic number, because the mean of its divisors is an integer number (2683210761532).
Almost surely, 25366421523063 is an apocalyptic number.
5366421523063 is a deficient number, since it is larger than the sum of its proper divisors (1).
5366421523063 is an equidigital number, since it uses as much as digits as its factorization.
5366421523063 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2332800, while the sum is 46.
Adding to 5366421523063 its reverse (3603251246635), we get a palindrome (8969672769698).
The spelling of 5366421523063 in words is "five trillion, three hundred sixty-six billion, four hundred twenty-one million, five hundred twenty-three thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •