Base | Representation |
---|---|
bin | 110000000100001111… |
… | …0001000000001011101 |
3 | 100212102200010212021201 |
4 | 1200020132020001131 |
5 | 3142344130030023 |
6 | 115230315155501 |
7 | 10312630554124 |
oct | 1401036100135 |
9 | 325380125251 |
10 | 103221330013 |
11 | 3a85982800a |
12 | 18008745b91 |
13 | 9970008b89 |
14 | 4dd2bdcabb |
15 | 2a41e4cbad |
hex | 180878805d |
103221330013 has 6 divisors (see below), whose sum is σ = 106658461662. Its totient is φ = 99891608760.
The previous prime is 103221330007. The next prime is 103221330041. The reversal of 103221330013 is 310033122301.
It can be written as a sum of positive squares in only one way, i.e., 103084018489 + 137311524 = 321067^2 + 11718^2 .
It is not a de Polignac number, because 103221330013 - 29 = 103221329501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103221330053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 53704206 + ... + 53706127.
It is an arithmetic number, because the mean of its divisors is an integer number (17776410277).
Almost surely, 2103221330013 is an apocalyptic number.
It is an amenable number.
103221330013 is a deficient number, since it is larger than the sum of its proper divisors (3437131649).
103221330013 is an equidigital number, since it uses as much as digits as its factorization.
103221330013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107410395 (or 107410364 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 103221330013 its reverse (310033122301), we get a palindrome (413254452314).
The spelling of 103221330013 in words is "one hundred three billion, two hundred twenty-one million, three hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •