Base | Representation |
---|---|
bin | 1001001110010010100111… |
… | …1011110110001011011001 |
3 | 1022220111000011221010001011 |
4 | 2103210221323312023121 |
5 | 2312123004030340441 |
6 | 33322433345053521 |
7 | 2064446304056632 |
oct | 223445173661331 |
9 | 38814004833034 |
10 | 10141121340121 |
11 | 325a909688632 |
12 | 11795010272a1 |
13 | 5873c4130585 |
14 | 270b93652889 |
15 | 128bd9313581 |
hex | 93929ef62d9 |
10141121340121 has 2 divisors, whose sum is σ = 10141121340122. Its totient is φ = 10141121340120.
The previous prime is 10141121340073. The next prime is 10141121340247. The reversal of 10141121340121 is 12104312114101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9090291330121 + 1050830010000 = 3015011^2 + 1025100^2 .
It is a cyclic number.
It is not a de Polignac number, because 10141121340121 - 235 = 10106761601753 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10141121340092 and 10141121340101.
It is not a weakly prime, because it can be changed into another prime (10141121346121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5070560670060 + 5070560670061.
It is an arithmetic number, because the mean of its divisors is an integer number (5070560670061).
Almost surely, 210141121340121 is an apocalyptic number.
It is an amenable number.
10141121340121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10141121340121 is an equidigital number, since it uses as much as digits as its factorization.
10141121340121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 22.
Adding to 10141121340121 its reverse (12104312114101), we get a palindrome (22245433454222).
The spelling of 10141121340121 in words is "ten trillion, one hundred forty-one billion, one hundred twenty-one million, three hundred forty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •