Base | Representation |
---|---|
bin | 100100011111011111001… |
… | …1001101010010010100011 |
3 | 122202110200022212220011201 |
4 | 1020332332121222102203 |
5 | 1124133040313413131 |
6 | 14400015215022031 |
7 | 1025231546034061 |
oct | 110767631522243 |
9 | 18673608786151 |
10 | 5015421232291 |
11 | 1664034596638 |
12 | 69003250a917 |
13 | 2a4c4bc76ba2 |
14 | 134a678db031 |
15 | 8a6e14e0761 |
hex | 48fbe66a4a3 |
5015421232291 has 2 divisors, whose sum is σ = 5015421232292. Its totient is φ = 5015421232290.
The previous prime is 5015421232277. The next prime is 5015421232439. The reversal of 5015421232291 is 1922321245105.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 5015421232291 - 25 = 5015421232259 is a prime.
It is a super-2 number, since 2×50154212322912 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5015421232291.
It is not a weakly prime, because it can be changed into another prime (5015421232201) 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, 2507710616145 + 2507710616146.
It is an arithmetic number, because the mean of its divisors is an integer number (2507710616146).
Almost surely, 25015421232291 is an apocalyptic number.
5015421232291 is a deficient number, since it is larger than the sum of its proper divisors (1).
5015421232291 is an equidigital number, since it uses as much as digits as its factorization.
5015421232291 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 37.
Adding to 5015421232291 its reverse (1922321245105), we get a palindrome (6937742477396).
The spelling of 5015421232291 in words is "five trillion, fifteen billion, four hundred twenty-one million, two hundred thirty-two thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •