Base | Representation |
---|---|
bin | 1001011001010011000000… |
… | …1110110111011000010101 |
3 | 1100120120001210020012200022 |
4 | 2112110300032313120111 |
5 | 2323222230110100401 |
6 | 33545344135554525 |
7 | 2114222060250143 |
oct | 226246016673025 |
9 | 40516053205608 |
10 | 10330205550101 |
11 | 33230197a8168 |
12 | 11aa090b2ba45 |
13 | 59c198aca7a8 |
14 | 279dadb04593 |
15 | 12daa42ce71b |
hex | 965303b7615 |
10330205550101 has 2 divisors, whose sum is σ = 10330205550102. Its totient is φ = 10330205550100.
The previous prime is 10330205550079. The next prime is 10330205550121. The reversal of 10330205550101 is 10105550203301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7589859700900 + 2740345849201 = 2754970^2 + 1655399^2 .
It is a cyclic number.
It is not a de Polignac number, because 10330205550101 - 214 = 10330205533717 is a prime.
It is a super-2 number, since 2×103302055501012 (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 (10330205550121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5165102775050 + 5165102775051.
It is an arithmetic number, because the mean of its divisors is an integer number (5165102775051).
Almost surely, 210330205550101 is an apocalyptic number.
It is an amenable number.
10330205550101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10330205550101 is an equidigital number, since it uses as much as digits as its factorization.
10330205550101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 26.
Adding to 10330205550101 its reverse (10105550203301), we get a palindrome (20435755753402).
The spelling of 10330205550101 in words is "ten trillion, three hundred thirty billion, two hundred five million, five hundred fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •