Base | Representation |
---|---|
bin | 1001001100000001001100… |
… | …0011011100011101001001 |
3 | 1022202202020111221021100101 |
4 | 2103000103003130131021 |
5 | 2311003031141002111 |
6 | 33252455512405401 |
7 | 2061565012404124 |
oct | 223002303343511 |
9 | 38682214837311 |
10 | 10102082750281 |
11 | 32452a6396245 |
12 | 1171a270a6861 |
13 | 5838122c6482 |
14 | 26cd2ca293bb |
15 | 127ba1e38bc1 |
hex | 930130dc749 |
10102082750281 has 2 divisors, whose sum is σ = 10102082750282. Its totient is φ = 10102082750280.
The previous prime is 10102082750273. The next prime is 10102082750293. The reversal of 10102082750281 is 18205728020101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10055342472256 + 46740278025 = 3171016^2 + 216195^2 .
It is a cyclic number.
It is not a de Polignac number, because 10102082750281 - 23 = 10102082750273 is a prime.
It is a super-2 number, since 2×101020827502812 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10102082750281.
It is not a weakly prime, because it can be changed into another prime (10102082759281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051041375140 + 5051041375141.
It is an arithmetic number, because the mean of its divisors is an integer number (5051041375141).
Almost surely, 210102082750281 is an apocalyptic number.
It is an amenable number.
10102082750281 is a deficient number, since it is larger than the sum of its proper divisors (1).
10102082750281 is an equidigital number, since it uses as much as digits as its factorization.
10102082750281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17920, while the sum is 37.
The spelling of 10102082750281 in words is "ten trillion, one hundred two billion, eighty-two million, seven hundred fifty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •