Base | Representation |
---|---|
bin | 110000000100010110… |
… | …1011010000011011111 |
3 | 100212102221200101111202 |
4 | 1200020231122003133 |
5 | 3142401141223111 |
6 | 115230541110115 |
7 | 10313006610356 |
oct | 1401055320337 |
9 | 325387611452 |
10 | 103225336031 |
11 | 3a861013874 |
12 | 18009b5833b |
13 | 9970aac3bc |
14 | 4dd356299d |
15 | 2a4248eb3b |
hex | 1808b5a0df |
103225336031 has 2 divisors, whose sum is σ = 103225336032. Its totient is φ = 103225336030.
The previous prime is 103225336009. The next prime is 103225336057. The reversal of 103225336031 is 130633522301.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103225336031 is a prime.
It is a super-2 number, since 2×1032253360312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 103225335985 and 103225336003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103222336031) 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, 51612668015 + 51612668016.
It is an arithmetic number, because the mean of its divisors is an integer number (51612668016).
Almost surely, 2103225336031 is an apocalyptic number.
103225336031 is a deficient number, since it is larger than the sum of its proper divisors (1).
103225336031 is an equidigital number, since it uses as much as digits as its factorization.
103225336031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9720, while the sum is 29.
Adding to 103225336031 its reverse (130633522301), we get a palindrome (233858858332).
The spelling of 103225336031 in words is "one hundred three billion, two hundred twenty-five million, three hundred thirty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •