Base | Representation |
---|---|
bin | 101111111110000010… |
… | …0010000001010011101 |
3 | 100211220011112211102021 |
4 | 1133330010100022131 |
5 | 3141432341033041 |
6 | 115153522500141 |
7 | 10304522634304 |
oct | 1377404201235 |
9 | 324804484367 |
10 | 103013221021 |
11 | 3a762306707 |
12 | 17b6ab04651 |
13 | 9938b72969 |
14 | 4db330943b |
15 | 2a2da40cd1 |
hex | 17fc11029d |
103013221021 has 2 divisors, whose sum is σ = 103013221022. Its totient is φ = 103013221020.
The previous prime is 103013220931. The next prime is 103013221039. The reversal of 103013221021 is 120122310301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102601699225 + 411521796 = 320315^2 + 20286^2 .
It is a cyclic number.
It is not a de Polignac number, because 103013221021 - 213 = 103013212829 is a prime.
It is a super-2 number, since 2×1030132210212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103013220986 and 103013221004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103613221021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51506610510 + 51506610511.
It is an arithmetic number, because the mean of its divisors is an integer number (51506610511).
Almost surely, 2103013221021 is an apocalyptic number.
It is an amenable number.
103013221021 is a deficient number, since it is larger than the sum of its proper divisors (1).
103013221021 is an equidigital number, since it uses as much as digits as its factorization.
103013221021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 103013221021 its reverse (120122310301), we get a palindrome (223135531322).
The spelling of 103013221021 in words is "one hundred three billion, thirteen million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •