Base | Representation |
---|---|
bin | 1001011000111001011001… |
… | …1010111010100111111101 |
3 | 1100112220022121202122102001 |
4 | 2112032112122322213331 |
5 | 2323114134443104212 |
6 | 33542250010102301 |
7 | 2113556512415026 |
oct | 226162632724775 |
9 | 40486277678361 |
10 | 10323330050557 |
11 | 3320110759637 |
12 | 11a889241a991 |
13 | 59b641536074 |
14 | 27991a915c4d |
15 | 12d8008a9657 |
hex | 963966ba9fd |
10323330050557 has 2 divisors, whose sum is σ = 10323330050558. Its totient is φ = 10323330050556.
The previous prime is 10323330050533. The next prime is 10323330050573. The reversal of 10323330050557 is 75505003332301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6492028818916 + 3831301231641 = 2547946^2 + 1957371^2 .
It is a cyclic number.
It is not a de Polignac number, because 10323330050557 - 219 = 10323329526269 is a prime.
It is a super-2 number, since 2×103233300505572 (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 (10323330050357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5161665025278 + 5161665025279.
It is an arithmetic number, because the mean of its divisors is an integer number (5161665025279).
Almost surely, 210323330050557 is an apocalyptic number.
It is an amenable number.
10323330050557 is a deficient number, since it is larger than the sum of its proper divisors (1).
10323330050557 is an equidigital number, since it uses as much as digits as its factorization.
10323330050557 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 141750, while the sum is 37.
Adding to 10323330050557 its reverse (75505003332301), we get a palindrome (85828333382858).
The spelling of 10323330050557 in words is "ten trillion, three hundred twenty-three billion, three hundred thirty million, fifty thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •