Base | Representation |
---|---|
bin | 1001010100001111010011… |
… | …1110110010001111101101 |
3 | 1100021020210000221021021121 |
4 | 2111003310332302033231 |
5 | 2320311300401224401 |
6 | 33441413532300541 |
7 | 2105024552346655 |
oct | 225036476621755 |
9 | 40236700837247 |
10 | 10243312133101 |
11 | 329a189724943 |
12 | 1195280611751 |
13 | 593c2b799a08 |
14 | 275ac9635365 |
15 | 12b6baa4bca1 |
hex | 950f4fb23ed |
10243312133101 has 2 divisors, whose sum is σ = 10243312133102. Its totient is φ = 10243312133100.
The previous prime is 10243312133077. The next prime is 10243312133147. The reversal of 10243312133101 is 10133121334201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6397206732900 + 3846105400201 = 2529270^2 + 1961149^2 .
It is a cyclic number.
It is not a de Polignac number, because 10243312133101 - 221 = 10243310035949 is a prime.
It is a super-2 number, since 2×102433121331012 (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 (10243312134101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5121656066550 + 5121656066551.
It is an arithmetic number, because the mean of its divisors is an integer number (5121656066551).
Almost surely, 210243312133101 is an apocalyptic number.
It is an amenable number.
10243312133101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10243312133101 is an equidigital number, since it uses as much as digits as its factorization.
10243312133101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 10243312133101 its reverse (10133121334201), we get a palindrome (20376433467302).
The spelling of 10243312133101 in words is "ten trillion, two hundred forty-three billion, three hundred twelve million, one hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •