Base | Representation |
---|---|
bin | 100110100110010101101… |
… | …0000011110100101001011 |
3 | 200210011011021220022211001 |
4 | 1031030223100132211023 |
5 | 1143404130122203121 |
6 | 15141031010515431 |
7 | 1055163046651222 |
oct | 115145320364513 |
9 | 20704137808731 |
10 | 5305010350411 |
11 | 176592a050222 |
12 | 718191295b77 |
13 | 2c634cc36955 |
14 | 144a9a0c1cb9 |
15 | 92edebcd991 |
hex | 4d32b41e94b |
5305010350411 has 2 divisors, whose sum is σ = 5305010350412. Its totient is φ = 5305010350410.
The previous prime is 5305010350361. The next prime is 5305010350417. The reversal of 5305010350411 is 1140530105035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5305010350411 - 223 = 5305001961803 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5305010350411.
It is not a weakly prime, because it can be changed into another prime (5305010350417) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2652505175205 + 2652505175206.
It is an arithmetic number, because the mean of its divisors is an integer number (2652505175206).
Almost surely, 25305010350411 is an apocalyptic number.
5305010350411 is a deficient number, since it is larger than the sum of its proper divisors (1).
5305010350411 is an equidigital number, since it uses as much as digits as its factorization.
5305010350411 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 5305010350411 its reverse (1140530105035), we get a palindrome (6445540455446).
The spelling of 5305010350411 in words is "five trillion, three hundred five billion, ten million, three hundred fifty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •