Base | Representation |
---|---|
bin | 1001011110101001100000… |
… | …1000011101000011111111 |
3 | 1100220100101001210020102012 |
4 | 2113222120020131003333 |
5 | 2331224022102404434 |
6 | 34055511050521435 |
7 | 2123655263634005 |
oct | 227523010350377 |
9 | 40810331706365 |
10 | 10422143013119 |
11 | 3359008031962 |
12 | 1203a6a73627b |
13 | 5a7a5b13c496 |
14 | 28061205ca75 |
15 | 1311857b93ce |
hex | 97a9821d0ff |
10422143013119 has 2 divisors, whose sum is σ = 10422143013120. Its totient is φ = 10422143013118.
The previous prime is 10422143012989. The next prime is 10422143013151. The reversal of 10422143013119 is 91131034122401.
It is an a-pointer prime, because the next prime (10422143013151) can be obtained adding 10422143013119 to its sum of digits (32).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10422143013119 - 228 = 10421874577663 is a prime.
It is a super-2 number, since 2×104221430131192 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10422143013619) 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, 5211071506559 + 5211071506560.
It is an arithmetic number, because the mean of its divisors is an integer number (5211071506560).
Almost surely, 210422143013119 is an apocalyptic number.
10422143013119 is a deficient number, since it is larger than the sum of its proper divisors (1).
10422143013119 is an equidigital number, since it uses as much as digits as its factorization.
10422143013119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 10422143013119 in words is "ten trillion, four hundred twenty-two billion, one hundred forty-three million, thirteen thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •