Base | Representation |
---|---|
bin | 1001001100000101011001… |
… | …1000011010010110110101 |
3 | 1022202212011020102100221121 |
4 | 2103001112120122112311 |
5 | 2311012334323221211 |
6 | 33253203543143541 |
7 | 2061635006524621 |
oct | 223012630322665 |
9 | 38685136370847 |
10 | 10103212320181 |
11 | 3245825a67892 |
12 | 11720a1444bb1 |
13 | 58396232b426 |
14 | 26cdd8a64181 |
15 | 127c1b1b1271 |
hex | 9305661a5b5 |
10103212320181 has 2 divisors, whose sum is σ = 10103212320182. Its totient is φ = 10103212320180.
The previous prime is 10103212320127. The next prime is 10103212320233. The reversal of 10103212320181 is 18102321230101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10082155408081 + 21056912100 = 3175241^2 + 145110^2 .
It is a cyclic number.
It is not a de Polignac number, because 10103212320181 - 27 = 10103212320053 is a prime.
It is a super-2 number, since 2×101032123201812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10103212360181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051606160090 + 5051606160091.
It is an arithmetic number, because the mean of its divisors is an integer number (5051606160091).
Almost surely, 210103212320181 is an apocalyptic number.
It is an amenable number.
10103212320181 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103212320181 is an equidigital number, since it uses as much as digits as its factorization.
10103212320181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 10103212320181 its reverse (18102321230101), we get a palindrome (28205533550282).
The spelling of 10103212320181 in words is "ten trillion, one hundred three billion, two hundred twelve million, three hundred twenty thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •