Base | Representation |
---|---|
bin | 110001100011101001… |
… | …0010001111111110101 |
3 | 101011200210000221211012 |
4 | 1203013102101333311 |
5 | 3220423201022042 |
6 | 120520115122005 |
7 | 10455152540555 |
oct | 1430722217765 |
9 | 334623027735 |
10 | 106422673397 |
11 | 41151908747 |
12 | 187608a3305 |
13 | a060327cc1 |
14 | 5218057165 |
15 | 2b7d013e82 |
hex | 18c7491ff5 |
106422673397 has 2 divisors, whose sum is σ = 106422673398. Its totient is φ = 106422673396.
The previous prime is 106422673391. The next prime is 106422673421. The reversal of 106422673397 is 793376224601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67745157841 + 38677515556 = 260279^2 + 196666^2 .
It is a cyclic number.
It is not a de Polignac number, because 106422673397 - 24 = 106422673381 is a prime.
It is a super-2 number, since 2×1064226733972 (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 (106422673391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53211336698 + 53211336699.
It is an arithmetic number, because the mean of its divisors is an integer number (53211336699).
Almost surely, 2106422673397 is an apocalyptic number.
It is an amenable number.
106422673397 is a deficient number, since it is larger than the sum of its proper divisors (1).
106422673397 is an equidigital number, since it uses as much as digits as its factorization.
106422673397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2286144, while the sum is 50.
Adding to 106422673397 its reverse (793376224601), we get a palindrome (899798897998).
The spelling of 106422673397 in words is "one hundred six billion, four hundred twenty-two million, six hundred seventy-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •