Base | Representation |
---|---|
bin | 110000001001111011… |
… | …0011010000010101101 |
3 | 100212220222101022221022 |
4 | 1200103312122002231 |
5 | 3143242013312103 |
6 | 115301255143525 |
7 | 10320436401434 |
oct | 1402366320255 |
9 | 325828338838 |
10 | 103412244653 |
11 | 3a947575003 |
12 | 18060674ba5 |
13 | 99a0731a13 |
14 | 50102d811b |
15 | 2a53ab0138 |
hex | 1813d9a0ad |
103412244653 has 2 divisors, whose sum is σ = 103412244654. Its totient is φ = 103412244652.
The previous prime is 103412244599. The next prime is 103412244671. The reversal of 103412244653 is 356442214301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97330272484 + 6081972169 = 311978^2 + 77987^2 .
It is a cyclic number.
It is not a de Polignac number, because 103412244653 - 26 = 103412244589 is a prime.
It is a super-4 number, since 4×1034122446534 (a number of 45 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103412243653) 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, 51706122326 + 51706122327.
It is an arithmetic number, because the mean of its divisors is an integer number (51706122327).
Almost surely, 2103412244653 is an apocalyptic number.
It is an amenable number.
103412244653 is a deficient number, since it is larger than the sum of its proper divisors (1).
103412244653 is an equidigital number, since it uses as much as digits as its factorization.
103412244653 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 103412244653 its reverse (356442214301), we get a palindrome (459854458954).
The spelling of 103412244653 in words is "one hundred three billion, four hundred twelve million, two hundred forty-four thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •