Base | Representation |
---|---|
bin | 1001001110001111010001… |
… | …1111010010011010110001 |
3 | 1022220101200200200002202121 |
4 | 2103203310133102122301 |
5 | 2312114140003124134 |
6 | 33322204354114241 |
7 | 2064415135322401 |
oct | 223436437223261 |
9 | 38811620602677 |
10 | 10140224661169 |
11 | 325a499514449 |
12 | 11792b087b981 |
13 | 5872b042a705 |
14 | 270b0a51c801 |
15 | 128b85740ab4 |
hex | 938f47d26b1 |
10140224661169 has 2 divisors, whose sum is σ = 10140224661170. Its totient is φ = 10140224661168.
The previous prime is 10140224661131. The next prime is 10140224661173. The reversal of 10140224661169 is 96116642204101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5188887635569 + 4951337025600 = 2277913^2 + 2225160^2 .
It is a cyclic number.
It is not a de Polignac number, because 10140224661169 - 27 = 10140224661041 is a prime.
It is a super-2 number, since 2×101402246611692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10140224661769) 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, 5070112330584 + 5070112330585.
It is an arithmetic number, because the mean of its divisors is an integer number (5070112330585).
Almost surely, 210140224661169 is an apocalyptic number.
It is an amenable number.
10140224661169 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140224661169 is an equidigital number, since it uses as much as digits as its factorization.
10140224661169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 124416, while the sum is 43.
The spelling of 10140224661169 in words is "ten trillion, one hundred forty billion, two hundred twenty-four million, six hundred sixty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •