Base | Representation |
---|---|
bin | 110000000100010010… |
… | …1010110000000001001 |
3 | 100212102210200222222201 |
4 | 1200020211112000021 |
5 | 3142400121103111 |
6 | 115230423520201 |
7 | 10312652625004 |
oct | 1401045260011 |
9 | 325383628881 |
10 | 103223222281 |
11 | 3a85a8aa773 |
12 | 180092b9061 |
13 | 997051c26a |
14 | 4dd317253b |
15 | 2a421c36c1 |
hex | 1808956009 |
103223222281 has 2 divisors, whose sum is σ = 103223222282. Its totient is φ = 103223222280.
The previous prime is 103223222227. The next prime is 103223222327. The reversal of 103223222281 is 182222322301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70066090000 + 33157132281 = 264700^2 + 182091^2 .
It is a cyclic number.
It is not a de Polignac number, because 103223222281 - 233 = 94633287689 is a prime.
It is a super-2 number, since 2×1032232222812 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (103223222381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51611611140 + 51611611141.
It is an arithmetic number, because the mean of its divisors is an integer number (51611611141).
Almost surely, 2103223222281 is an apocalyptic number.
It is an amenable number.
103223222281 is a deficient number, since it is larger than the sum of its proper divisors (1).
103223222281 is an equidigital number, since it uses as much as digits as its factorization.
103223222281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 103223222281 its reverse (182222322301), we get a palindrome (285445544582).
The spelling of 103223222281 in words is "one hundred three billion, two hundred twenty-three million, two hundred twenty-two thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •