Base | Representation |
---|---|
bin | 1001011110101010101000… |
… | …0110001010011011011101 |
3 | 1100220101011001220101210001 |
4 | 2113222222012022123131 |
5 | 2331230131231334042 |
6 | 34100001014414301 |
7 | 2123665613460646 |
oct | 227525206123335 |
9 | 40811131811701 |
10 | 10422444402397 |
11 | 3359152175105 |
12 | 1203b33661391 |
13 | 5a7aa8705731 |
14 | 2806400b46cd |
15 | 1311a1e9ebb7 |
hex | 97aaa18a6dd |
10422444402397 has 2 divisors, whose sum is σ = 10422444402398. Its totient is φ = 10422444402396.
The previous prime is 10422444402367. The next prime is 10422444402401. The reversal of 10422444402397 is 79320444422401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9664071646681 + 758372755716 = 3108709^2 + 870846^2 .
It is a cyclic number.
It is not a de Polignac number, because 10422444402397 - 215 = 10422444369629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10422444402347) 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, 5211222201198 + 5211222201199.
It is an arithmetic number, because the mean of its divisors is an integer number (5211222201199).
Almost surely, 210422444402397 is an apocalyptic number.
It is an amenable number.
10422444402397 is a deficient number, since it is larger than the sum of its proper divisors (1).
10422444402397 is an equidigital number, since it uses as much as digits as its factorization.
10422444402397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1548288, while the sum is 46.
Adding to 10422444402397 its reverse (79320444422401), we get a palindrome (89742888824798).
The spelling of 10422444402397 in words is "ten trillion, four hundred twenty-two billion, four hundred forty-four million, four hundred two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •