Base | Representation |
---|---|
bin | 101110101010011001000… |
… | …0110000100001001011101 |
3 | 211201002122210100000110111 |
4 | 1131110302012010021131 |
5 | 1320033242003423311 |
6 | 21350110131410021 |
7 | 1231224506601031 |
oct | 135246206041135 |
9 | 24632583300414 |
10 | 6413226623581 |
11 | 205291a266918 |
12 | 876b14753911 |
13 | 3769c2cb930b |
14 | 18258a8701c1 |
15 | b1c51b4ad21 |
hex | 5d53218425d |
6413226623581 has 2 divisors, whose sum is σ = 6413226623582. Its totient is φ = 6413226623580.
The previous prime is 6413226623569. The next prime is 6413226623659. The reversal of 6413226623581 is 1853266223146.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4848513340356 + 1564713283225 = 2201934^2 + 1250885^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6413226623581 is a prime.
It is a super-2 number, since 2×64132266235812 (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 (6413226683581) 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, 3206613311790 + 3206613311791.
It is an arithmetic number, because the mean of its divisors is an integer number (3206613311791).
Almost surely, 26413226623581 is an apocalyptic number.
It is an amenable number.
6413226623581 is a deficient number, since it is larger than the sum of its proper divisors (1).
6413226623581 is an equidigital number, since it uses as much as digits as its factorization.
6413226623581 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2488320, while the sum is 49.
The spelling of 6413226623581 in words is "six trillion, four hundred thirteen billion, two hundred twenty-six million, six hundred twenty-three thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •