Base | Representation |
---|---|
bin | 111011001101101011101… |
… | …0011010000111011010101 |
3 | 1001211000022201222220102111 |
4 | 1312123113103100323111 |
5 | 2031314144213211013 |
6 | 25150401352511021 |
7 | 1466654112261013 |
oct | 166332723207325 |
9 | 31730281886374 |
10 | 8138280210133 |
11 | 2658475017837 |
12 | ab53056ab471 |
13 | 47058a09acc8 |
14 | 201c757138b3 |
15 | e1a66bc473d |
hex | 766d74d0ed5 |
8138280210133 has 2 divisors, whose sum is σ = 8138280210134. Its totient is φ = 8138280210132.
The previous prime is 8138280210131. The next prime is 8138280210173. The reversal of 8138280210133 is 3310120828318.
It is a happy number.
It is an a-pointer prime, because the next prime (8138280210173) can be obtained adding 8138280210133 to its sum of digits (40).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5563644952644 + 2574635257489 = 2358738^2 + 1604567^2 .
It is a cyclic number.
It is not a de Polignac number, because 8138280210133 - 21 = 8138280210131 is a prime.
Together with 8138280210131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (8138280210131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4069140105066 + 4069140105067.
It is an arithmetic number, because the mean of its divisors is an integer number (4069140105067).
Almost surely, 28138280210133 is an apocalyptic number.
It is an amenable number.
8138280210133 is a deficient number, since it is larger than the sum of its proper divisors (1).
8138280210133 is an equidigital number, since it uses as much as digits as its factorization.
8138280210133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 40.
The spelling of 8138280210133 in words is "eight trillion, one hundred thirty-eight billion, two hundred eighty million, two hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •