Base | Representation |
---|---|
bin | 10111001110001110110001… |
… | …111001111111100000010001 |
3 | 111101121211011012220012211222 |
4 | 113032032301321333200101 |
5 | 101341321402044214022 |
6 | 1001115131422414425 |
7 | 30340603151640533 |
oct | 2716166171774021 |
9 | 441554135805758 |
10 | 102133012101137 |
11 | 2a5a7404802276 |
12 | b55608b131415 |
13 | 44cb1426123b4 |
14 | 1b3139ac03853 |
15 | bc1aa9c95242 |
hex | 5ce3b1e7f811 |
102133012101137 has 2 divisors, whose sum is σ = 102133012101138. Its totient is φ = 102133012101136.
The previous prime is 102133012101083. The next prime is 102133012101139. The reversal of 102133012101137 is 731101210331201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60179876789761 + 41953135311376 = 7757569^2 + 6477124^2 .
It is a cyclic number.
It is not a de Polignac number, because 102133012101137 - 218 = 102133011838993 is a prime.
Together with 102133012101139, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (102133012101139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51066506050568 + 51066506050569.
It is an arithmetic number, because the mean of its divisors is an integer number (51066506050569).
Almost surely, 2102133012101137 is an apocalyptic number.
It is an amenable number.
102133012101137 is a deficient number, since it is larger than the sum of its proper divisors (1).
102133012101137 is an equidigital number, since it uses as much as digits as its factorization.
102133012101137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 756, while the sum is 26.
Adding to 102133012101137 its reverse (731101210331201), we get a palindrome (833234222432338).
The spelling of 102133012101137 in words is "one hundred two trillion, one hundred thirty-three billion, twelve million, one hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •