Base | Representation |
---|---|
bin | 100111011100011010010… |
… | …0111101000001111001011 |
3 | 201012020212222101111200010 |
4 | 1032320310213220033023 |
5 | 1202304434132444321 |
6 | 15310233342443003 |
7 | 1066443456466644 |
oct | 116706447501713 |
9 | 21166788344603 |
10 | 5421131531211 |
11 | 18000a846a040 |
12 | 736799b93463 |
13 | 30429764ab16 |
14 | 14a55421a6cb |
15 | 96039399676 |
hex | 4ee349e83cb |
5421131531211 has 48 divisors (see below), whose sum is σ = 8323195789440. Its totient is φ = 3112216525440.
The previous prime is 5421131531161. The next prime is 5421131531251. The reversal of 5421131531211 is 1121351311245.
5421131531211 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5421131531211 - 237 = 5283692577739 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5421131531251) 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 in 47 ways as a sum of consecutive naturals, for example, 112184391 + ... + 112232703.
It is an arithmetic number, because the mean of its divisors is an integer number (173399912280).
Almost surely, 25421131531211 is an apocalyptic number.
5421131531211 is a deficient number, since it is larger than the sum of its proper divisors (2902064258229).
5421131531211 is a wasteful number, since it uses less digits than its factorization.
5421131531211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57784 (or 57765 counting only the distinct ones).
The product of its digits is 3600, while the sum is 30.
Adding to 5421131531211 its reverse (1121351311245), we get a palindrome (6542482842456).
The spelling of 5421131531211 in words is "five trillion, four hundred twenty-one billion, one hundred thirty-one million, five hundred thirty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •