Base | Representation |
---|---|
bin | 100110000001110101110… |
… | …1001001010111011101101 |
3 | 200111122212002100110011221 |
4 | 1030003223221022323231 |
5 | 1141113121204423011 |
6 | 15041025442343341 |
7 | 1046416566114004 |
oct | 114035351127355 |
9 | 20448762313157 |
10 | 5226633670381 |
11 | 173566a4a34a2 |
12 | 704b5905ab51 |
13 | 2bbb3c2111c6 |
14 | 140d82b8bc3b |
15 | 90e53eb8971 |
hex | 4c0eba4aeed |
5226633670381 has 2 divisors, whose sum is σ = 5226633670382. Its totient is φ = 5226633670380.
The previous prime is 5226633670241. The next prime is 5226633670387. The reversal of 5226633670381 is 1830763366225.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5127371496900 + 99262173481 = 2264370^2 + 315059^2 .
It is a cyclic number.
It is not a de Polignac number, because 5226633670381 - 213 = 5226633662189 is a prime.
It is a super-2 number, since 2×52266336703812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5226633670387) 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, 2613316835190 + 2613316835191.
It is an arithmetic number, because the mean of its divisors is an integer number (2613316835191).
Almost surely, 25226633670381 is an apocalyptic number.
It is an amenable number.
5226633670381 is a deficient number, since it is larger than the sum of its proper divisors (1).
5226633670381 is an equidigital number, since it uses as much as digits as its factorization.
5226633670381 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6531840, while the sum is 52.
The spelling of 5226633670381 in words is "five trillion, two hundred twenty-six billion, six hundred thirty-three million, six hundred seventy thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •