Base | Representation |
---|---|
bin | 101000010010111010001… |
… | …1101101110110100110101 |
3 | 201121102222100212221102221 |
4 | 1100211310131232310311 |
5 | 1211214131144424243 |
6 | 15440110530402341 |
7 | 1111055636022136 |
oct | 120456435566465 |
9 | 21542870787387 |
10 | 5538166795573 |
11 | 18457a585a415 |
12 | 755400a303b1 |
13 | 312329549b39 |
14 | 1520978d9c8d |
15 | 990d8e24bed |
hex | 5097476ed35 |
5538166795573 has 2 divisors, whose sum is σ = 5538166795574. Its totient is φ = 5538166795572.
The previous prime is 5538166795517. The next prime is 5538166795627. The reversal of 5538166795573 is 3755976618355.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3914474121009 + 1623692674564 = 1978503^2 + 1274242^2 .
It is a cyclic number.
It is not a de Polignac number, because 5538166795573 - 221 = 5538164698421 is a prime.
It is a super-2 number, since 2×55381667955732 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5538166775573) 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, 2769083397786 + 2769083397787.
It is an arithmetic number, because the mean of its divisors is an integer number (2769083397787).
Almost surely, 25538166795573 is an apocalyptic number.
It is an amenable number.
5538166795573 is a deficient number, since it is larger than the sum of its proper divisors (1).
5538166795573 is an equidigital number, since it uses as much as digits as its factorization.
5538166795573 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 714420000, while the sum is 70.
The spelling of 5538166795573 in words is "five trillion, five hundred thirty-eight billion, one hundred sixty-six million, seven hundred ninety-five thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •