Base | Representation |
---|---|
bin | 101111100000001100… |
… | …1010100010111001001 |
3 | 100202022101210010122201 |
4 | 1133000121110113021 |
5 | 3132410100012111 |
6 | 114510321320201 |
7 | 10240645426144 |
oct | 1370031242711 |
9 | 322271703581 |
10 | 102012110281 |
11 | 3a2991a4364 |
12 | 1792b796061 |
13 | 9809637043 |
14 | 4d1a38d05b |
15 | 29c0be06c1 |
hex | 17c06545c9 |
102012110281 has 2 divisors, whose sum is σ = 102012110282. Its totient is φ = 102012110280.
The previous prime is 102012110279. The next prime is 102012110329. The reversal of 102012110281 is 182011210201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 67838890681 + 34173219600 = 260459^2 + 184860^2 .
It is a cyclic number.
It is not a de Polignac number, because 102012110281 - 21 = 102012110279 is a prime.
It is a super-2 number, since 2×1020121102812 (a number of 23 digits) contains 22 as substring.
Together with 102012110279, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (102012110881) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51006055140 + 51006055141.
It is an arithmetic number, because the mean of its divisors is an integer number (51006055141).
Almost surely, 2102012110281 is an apocalyptic number.
It is an amenable number.
102012110281 is a deficient number, since it is larger than the sum of its proper divisors (1).
102012110281 is an equidigital number, since it uses as much as digits as its factorization.
102012110281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 102012110281 its reverse (182011210201), we get a palindrome (284023320482).
The spelling of 102012110281 in words is "one hundred two billion, twelve million, one hundred ten thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.263 sec. • engine limits •