Base | Representation |
---|---|
bin | 110001100011101000… |
… | …0111010000111101101 |
3 | 101011200202100200001221 |
4 | 1203013100322013231 |
5 | 3220423103012303 |
6 | 120520103303341 |
7 | 10455146511301 |
oct | 1430720720755 |
9 | 334622320057 |
10 | 106422313453 |
11 | 41151692275 |
12 | 1876074ab51 |
13 | a060230211 |
14 | 5217da1d01 |
15 | 2b7ce924bd |
hex | 18c743a1ed |
106422313453 has 2 divisors, whose sum is σ = 106422313454. Its totient is φ = 106422313452.
The previous prime is 106422313423. The next prime is 106422313477. The reversal of 106422313453 is 354313224601.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105013587364 + 1408726089 = 324058^2 + 37533^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-106422313453 is a prime.
It is a super-2 number, since 2×1064223134532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106422313423) 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, 53211156726 + 53211156727.
It is an arithmetic number, because the mean of its divisors is an integer number (53211156727).
Almost surely, 2106422313453 is an apocalyptic number.
It is an amenable number.
106422313453 is a deficient number, since it is larger than the sum of its proper divisors (1).
106422313453 is an equidigital number, since it uses as much as digits as its factorization.
106422313453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 34.
The spelling of 106422313453 in words is "one hundred six billion, four hundred twenty-two million, three hundred thirteen thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •