Base | Representation |
---|---|
bin | 10111001110001110110001… |
… | …001111101110001101010001 |
3 | 111101121211010110001020201102 |
4 | 113032032301033232031101 |
5 | 101341321341230121431 |
6 | 1001115130345114145 |
7 | 30340602655516652 |
oct | 2716166117561521 |
9 | 441554113036642 |
10 | 102133001020241 |
11 | 2a5a73a9524004 |
12 | b556087488955 |
13 | 44cb140232859 |
14 | 1b3139955b529 |
15 | bc1aa8d06dcb |
hex | 5ce3b13ee351 |
102133001020241 has 2 divisors, whose sum is σ = 102133001020242. Its totient is φ = 102133001020240.
The previous prime is 102133001020217. The next prime is 102133001020321. The reversal of 102133001020241 is 142020100331201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 91517922250000 + 10615078770241 = 9566500^2 + 3258079^2 .
It is a cyclic number.
It is not a de Polignac number, because 102133001020241 - 214 = 102133001003857 is a prime.
It is a super-2 number, since 2×1021330010202412 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (102133001020541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51066500510120 + 51066500510121.
It is an arithmetic number, because the mean of its divisors is an integer number (51066500510121).
Almost surely, 2102133001020241 is an apocalyptic number.
It is an amenable number.
102133001020241 is a deficient number, since it is larger than the sum of its proper divisors (1).
102133001020241 is an equidigital number, since it uses as much as digits as its factorization.
102133001020241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 102133001020241 its reverse (142020100331201), we get a palindrome (244153101351442).
The spelling of 102133001020241 in words is "one hundred two trillion, one hundred thirty-three billion, one million, twenty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •