Base | Representation |
---|---|
bin | 1001011000110000110011… |
… | …0011000101100100100001 |
3 | 1100112200100201010101021102 |
4 | 2112030030303011210201 |
5 | 2323044422402143131 |
6 | 33541224530004145 |
7 | 2113445345054165 |
oct | 226141463054441 |
9 | 40480321111242 |
10 | 10321021131041 |
11 | 331a1363a6195 |
12 | 11a8349116655 |
13 | 59b36408a0ba |
14 | 27977c004ca5 |
15 | 12d717d251cb |
hex | 9630ccc5921 |
10321021131041 has 2 divisors, whose sum is σ = 10321021131042. Its totient is φ = 10321021131040.
The previous prime is 10321021131011. The next prime is 10321021131061. The reversal of 10321021131041 is 14013112012301.
It is an a-pointer prime, because the next prime (10321021131061) can be obtained adding 10321021131041 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7582423104400 + 2738598026641 = 2753620^2 + 1654871^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10321021131041 is a prime.
It is not a weakly prime, because it can be changed into another prime (10321021131011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5160510565520 + 5160510565521.
It is an arithmetic number, because the mean of its divisors is an integer number (5160510565521).
Almost surely, 210321021131041 is an apocalyptic number.
It is an amenable number.
10321021131041 is a deficient number, since it is larger than the sum of its proper divisors (1).
10321021131041 is an equidigital number, since it uses as much as digits as its factorization.
10321021131041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 10321021131041 its reverse (14013112012301), we get a palindrome (24334133143342).
The spelling of 10321021131041 in words is "ten trillion, three hundred twenty-one billion, twenty-one million, one hundred thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •