Base | Representation |
---|---|
bin | 110000000111001011… |
… | …1110000010011111011 |
3 | 100212200120102020120121 |
4 | 1200032113300103323 |
5 | 3143100000321243 |
6 | 115244213034111 |
7 | 10315242154300 |
oct | 1401627602373 |
9 | 325616366517 |
10 | 103320323323 |
11 | 3a8aa6a1168 |
12 | 18035925937 |
13 | 99876893b9 |
14 | 500200b0a7 |
15 | 2a4a9a41ed |
hex | 180e5f04fb |
103320323323 has 6 divisors (see below), whose sum is σ = 120188947596. Its totient is φ = 88560277092.
The previous prime is 103320323317. The next prime is 103320323329. The reversal of 103320323323 is 323323023301.
It is an interprime number because it is at equal distance from previous prime (103320323317) and next prime (103320323329).
It is a de Polignac number, because none of the positive numbers 2k-103320323323 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103320323329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1054288965 + ... + 1054289062.
It is an arithmetic number, because the mean of its divisors is an integer number (20031491266).
Almost surely, 2103320323323 is an apocalyptic number.
103320323323 is a deficient number, since it is larger than the sum of its proper divisors (16868624273).
103320323323 is an equidigital number, since it uses as much as digits as its factorization.
103320323323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2108578041 (or 2108578034 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 25.
Adding to 103320323323 its reverse (323323023301), we get a palindrome (426643346624).
The spelling of 103320323323 in words is "one hundred three billion, three hundred twenty million, three hundred twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •