Base | Representation |
---|---|
bin | 10111001111101011111001… |
… | …101010101111010101100001 |
3 | 111101222101020120100111212002 |
4 | 113033223321222233111201 |
5 | 101344441141034410423 |
6 | 1001233105245013345 |
7 | 30351043023460061 |
oct | 2717537152572541 |
9 | 441871216314762 |
10 | 102233000310113 |
11 | 2a635854514622 |
12 | b571534b54255 |
13 | 45076b8853caa |
14 | 1b361644753a1 |
15 | bc44ace51228 |
hex | 5cfaf9aaf561 |
102233000310113 has 2 divisors, whose sum is σ = 102233000310114. Its totient is φ = 102233000310112.
The previous prime is 102233000310101. The next prime is 102233000310179. The reversal of 102233000310113 is 311013000332201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100342232307409 + 1890768002704 = 10017097^2 + 1375052^2 .
It is a cyclic number.
It is not a de Polignac number, because 102233000310113 - 24 = 102233000310097 is a prime.
It is not a weakly prime, because it can be changed into another prime (102233000310713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51116500155056 + 51116500155057.
It is an arithmetic number, because the mean of its divisors is an integer number (51116500155057).
Almost surely, 2102233000310113 is an apocalyptic number.
It is an amenable number.
102233000310113 is a deficient number, since it is larger than the sum of its proper divisors (1).
102233000310113 is an equidigital number, since it uses as much as digits as its factorization.
102233000310113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 102233000310113 its reverse (311013000332201), we get a palindrome (413246000642314).
The spelling of 102233000310113 in words is "one hundred two trillion, two hundred thirty-three billion, three hundred ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •