Base | Representation |
---|---|
bin | 1001001110001111101011… |
… | …1000111010001110100111 |
3 | 1022220101222011201120101002 |
4 | 2103203322320322032213 |
5 | 2312114400000304002 |
6 | 33322223151423515 |
7 | 2064420611122451 |
oct | 223437270721647 |
9 | 38811864646332 |
10 | 10140332041127 |
11 | 325a544096612 |
12 | 1179320824b9b |
13 | 5872c9756352 |
14 | 270b1a8b12d1 |
15 | 128b8eda2002 |
hex | 938fae3a3a7 |
10140332041127 has 2 divisors, whose sum is σ = 10140332041128. Its totient is φ = 10140332041126.
The previous prime is 10140332041121. The next prime is 10140332041181. The reversal of 10140332041127 is 72114023304101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10140332041127 - 238 = 9865454134183 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10140332041127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10140332041121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070166020563 + 5070166020564.
It is an arithmetic number, because the mean of its divisors is an integer number (5070166020564).
Almost surely, 210140332041127 is an apocalyptic number.
10140332041127 is a deficient number, since it is larger than the sum of its proper divisors (1).
10140332041127 is an equidigital number, since it uses as much as digits as its factorization.
10140332041127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 29.
Adding to 10140332041127 its reverse (72114023304101), we get a palindrome (82254355345228).
The spelling of 10140332041127 in words is "ten trillion, one hundred forty billion, three hundred thirty-two million, forty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •