Base | Representation |
---|---|
bin | 111011101101011011000… |
… | …111000011011010010001 |
3 | 112112021010121202001012111 |
4 | 323231123013003122101 |
5 | 1014211344404441223 |
6 | 12420554435025321 |
7 | 602306450310412 |
oct | 73553307033221 |
9 | 15467117661174 |
10 | 4103222343313 |
11 | 1342192050a15 |
12 | 563294a3b241 |
13 | 239c1709a8a2 |
14 | 102850323809 |
15 | 71b0305830d |
hex | 3bb5b1c3691 |
4103222343313 has 2 divisors, whose sum is σ = 4103222343314. Its totient is φ = 4103222343312.
The previous prime is 4103222343223. The next prime is 4103222343317. The reversal of 4103222343313 is 3133432223014.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2352226487809 + 1750995855504 = 1533697^2 + 1323252^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4103222343313 is a prime.
It is not a weakly prime, because it can be changed into another prime (4103222343317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2051611171656 + 2051611171657.
It is an arithmetic number, because the mean of its divisors is an integer number (2051611171657).
Almost surely, 24103222343313 is an apocalyptic number.
It is an amenable number.
4103222343313 is a deficient number, since it is larger than the sum of its proper divisors (1).
4103222343313 is an equidigital number, since it uses as much as digits as its factorization.
4103222343313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 4103222343313 its reverse (3133432223014), we get a palindrome (7236654566327).
The spelling of 4103222343313 in words is "four trillion, one hundred three billion, two hundred twenty-two million, three hundred forty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •