Base | Representation |
---|---|
bin | 100100110001100100001… |
… | …0000111001100101000011 |
3 | 122220011212202220102110211 |
4 | 1021203020100321211003 |
5 | 1130302041300212233 |
6 | 14425515250134551 |
7 | 1031104546111555 |
oct | 111431020714503 |
9 | 18804782812424 |
10 | 5054241413443 |
11 | 1679545572282 |
12 | 697667281457 |
13 | 2a87c777c991 |
14 | 1368ab50d4d5 |
15 | 8b7146265cd |
hex | 498c8439943 |
5054241413443 has 2 divisors, whose sum is σ = 5054241413444. Its totient is φ = 5054241413442.
The previous prime is 5054241413413. The next prime is 5054241413489. The reversal of 5054241413443 is 3443141424505.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5054241413443 - 213 = 5054241405251 is a prime.
It is a super-2 number, since 2×50542414134432 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5054241413396 and 5054241413405.
It is not a weakly prime, because it can be changed into another prime (5054241413413) 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, 2527120706721 + 2527120706722.
It is an arithmetic number, because the mean of its divisors is an integer number (2527120706722).
Almost surely, 25054241413443 is an apocalyptic number.
5054241413443 is a deficient number, since it is larger than the sum of its proper divisors (1).
5054241413443 is an equidigital number, since it uses as much as digits as its factorization.
5054241413443 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 460800, while the sum is 40.
Adding to 5054241413443 its reverse (3443141424505), we get a palindrome (8497382837948).
The spelling of 5054241413443 in words is "five trillion, fifty-four billion, two hundred forty-one million, four hundred thirteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •