Base | Representation |
---|---|
bin | 1001001110010011101111… |
… | …1010101000010110101001 |
3 | 1022220111210012120121000121 |
4 | 2103210323322220112221 |
5 | 2312124113242324431 |
6 | 33322523323003241 |
7 | 2064456626166364 |
oct | 223447372502651 |
9 | 38814705517017 |
10 | 10141423011241 |
11 | 325aa539a3605 |
12 | 1179586069521 |
13 | 587441794bb2 |
14 | 270bc173d0db |
15 | 128c05a52611 |
hex | 9393bea85a9 |
10141423011241 has 2 divisors, whose sum is σ = 10141423011242. Its totient is φ = 10141423011240.
The previous prime is 10141423011199. The next prime is 10141423011253. The reversal of 10141423011241 is 14211032414101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9390087705625 + 751335305616 = 3064325^2 + 866796^2 .
It is a cyclic number.
It is not a de Polignac number, because 10141423011241 - 29 = 10141423010729 is a prime.
It is not a weakly prime, because it can be changed into another prime (10141423011271) 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, 5070711505620 + 5070711505621.
It is an arithmetic number, because the mean of its divisors is an integer number (5070711505621).
Almost surely, 210141423011241 is an apocalyptic number.
It is an amenable number.
10141423011241 is a deficient number, since it is larger than the sum of its proper divisors (1).
10141423011241 is an equidigital number, since it uses as much as digits as its factorization.
10141423011241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 25.
Adding to 10141423011241 its reverse (14211032414101), we get a palindrome (24352455425342).
The spelling of 10141423011241 in words is "ten trillion, one hundred forty-one billion, four hundred twenty-three million, eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •