Base | Representation |
---|---|
bin | 1001001110001111011011… |
… | …1001010000001111101001 |
3 | 1022220101210111121200000112 |
4 | 2103203312321100033221 |
5 | 2312114230321204231 |
6 | 33322212355144105 |
7 | 2064416135353631 |
oct | 223436671201751 |
9 | 38811714550015 |
10 | 10140265022441 |
11 | 325a50a281474 |
12 | 11793022a5035 |
13 | 5872b88bc818 |
14 | 270b11a276c1 |
15 | 128b8906492b |
hex | 938f6e503e9 |
10140265022441 has 2 divisors, whose sum is σ = 10140265022442. Its totient is φ = 10140265022440.
The previous prime is 10140265022383. The next prime is 10140265022477. The reversal of 10140265022441 is 14422056204101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8317686721600 + 1822578300841 = 2884040^2 + 1350029^2 .
It is a cyclic number.
It is not a de Polignac number, because 10140265022441 - 234 = 10123085153257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10140265022398 and 10140265022407.
It is not a weakly prime, because it can be changed into another prime (10140265052441) 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, 5070132511220 + 5070132511221.
It is an arithmetic number, because the mean of its divisors is an integer number (5070132511221).
Almost surely, 210140265022441 is an apocalyptic number.
It is an amenable number.
10140265022441 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140265022441 is an equidigital number, since it uses as much as digits as its factorization.
10140265022441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15360, while the sum is 32.
The spelling of 10140265022441 in words is "ten trillion, one hundred forty billion, two hundred sixty-five million, twenty-two thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •