Base | Representation |
---|---|
bin | 10111011110001001001000… |
… | …001101110010100100100111 |
3 | 111112111100112011200112002101 |
4 | 113132021020031302210213 |
5 | 102012230240111113011 |
6 | 1003313325022552531 |
7 | 30512602541021245 |
oct | 2736111015624447 |
9 | 445440464615071 |
10 | 103226455566631 |
11 | 2a989104071901 |
12 | b6b1b8b138747 |
13 | 457a29cc34047 |
14 | 1b6c2895cb795 |
15 | be0254d292c1 |
hex | 5de248372927 |
103226455566631 has 2 divisors, whose sum is σ = 103226455566632. Its totient is φ = 103226455566630.
The previous prime is 103226455566629. The next prime is 103226455566643. The reversal of 103226455566631 is 136665554622301.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 103226455566631 - 21 = 103226455566629 is a prime.
It is a super-2 number, since 2×1032264555666312 (a number of 29 digits) contains 22 as substring.
Together with 103226455566629, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103226455596631) 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, 51613227783315 + 51613227783316.
It is an arithmetic number, because the mean of its divisors is an integer number (51613227783316).
Almost surely, 2103226455566631 is an apocalyptic number.
103226455566631 is a deficient number, since it is larger than the sum of its proper divisors (1).
103226455566631 is an equidigital number, since it uses as much as digits as its factorization.
103226455566631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328000, while the sum is 55.
The spelling of 103226455566631 in words is "one hundred three trillion, two hundred twenty-six billion, four hundred fifty-five million, five hundred sixty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •