Base | Representation |
---|---|
bin | 100100110110110011001… |
… | …0001101110110111100001 |
3 | 122221020220011202000002001 |
4 | 1021231212101232313201 |
5 | 1130443101441211213 |
6 | 14435014522524001 |
7 | 1031653242456346 |
oct | 111554621566741 |
9 | 18836804660061 |
10 | 5065482366433 |
11 | 1683293814675 |
12 | 699883966601 |
13 | 2a989959cb58 |
14 | 1372563c27cd |
15 | 8bb7140e1dd |
hex | 49b6646ede1 |
5065482366433 has 2 divisors, whose sum is σ = 5065482366434. Its totient is φ = 5065482366432.
The previous prime is 5065482366389. The next prime is 5065482366449. The reversal of 5065482366433 is 3346632845605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4903066918369 + 162415448064 = 2214287^2 + 403008^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5065482366433 is a prime.
It is a super-2 number, since 2×50654823664332 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5065482363433) 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, 2532741183216 + 2532741183217.
It is an arithmetic number, because the mean of its divisors is an integer number (2532741183217).
Almost surely, 25065482366433 is an apocalyptic number.
It is an amenable number.
5065482366433 is a deficient number, since it is larger than the sum of its proper divisors (1).
5065482366433 is an equidigital number, since it uses as much as digits as its factorization.
5065482366433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37324800, while the sum is 55.
The spelling of 5065482366433 in words is "five trillion, sixty-five billion, four hundred eighty-two million, three hundred sixty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •