Base | Representation |
---|---|
bin | 100110100110100100100… |
… | …1110010101000000110101 |
3 | 200210012110022220211021121 |
4 | 1031031021032111000311 |
5 | 1143411142323302123 |
6 | 15141152530343541 |
7 | 1055211363202345 |
oct | 115151116250065 |
9 | 20705408824247 |
10 | 5305513103413 |
11 | 1766067917a76 |
12 | 7182b172abb1 |
13 | 2c6400143b33 |
14 | 144b06b92d25 |
15 | 9301dddc75d |
hex | 4d349395035 |
5305513103413 has 2 divisors, whose sum is σ = 5305513103414. Its totient is φ = 5305513103412.
The previous prime is 5305513103399. The next prime is 5305513103419. The reversal of 5305513103413 is 3143013155035.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5291945978929 + 13567124484 = 2300423^2 + 116478^2 .
It is a cyclic number.
It is not a de Polignac number, because 5305513103413 - 25 = 5305513103381 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5305513103419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2652756551706 + 2652756551707.
It is an arithmetic number, because the mean of its divisors is an integer number (2652756551707).
Almost surely, 25305513103413 is an apocalyptic number.
It is an amenable number.
5305513103413 is a deficient number, since it is larger than the sum of its proper divisors (1).
5305513103413 is an equidigital number, since it uses as much as digits as its factorization.
5305513103413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 34.
Adding to 5305513103413 its reverse (3143013155035), we get a palindrome (8448526258448).
The spelling of 5305513103413 in words is "five trillion, three hundred five billion, five hundred thirteen million, one hundred three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •