Base | Representation |
---|---|
bin | 110000000111010000… |
… | …1111101110011001011 |
3 | 100212200202110020022012 |
4 | 1200032201331303023 |
5 | 3143101142000021 |
6 | 115244350250135 |
7 | 10315304003120 |
oct | 1401641756313 |
9 | 325622406265 |
10 | 103323000011 |
11 | 3a90115a200 |
12 | 180367b694b |
13 | 99880b583a |
14 | 5002506747 |
15 | 2a4ad3235b |
hex | 180e87dccb |
103323000011 has 24 divisors (see below), whose sum is σ = 132959938272. Its totient is φ = 78547708800.
The previous prime is 103323000007. The next prime is 103323000013. The reversal of 103323000011 is 110000323301.
It is not a de Polignac number, because 103323000011 - 22 = 103323000007 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103323000011.
It is not an unprimeable number, because it can be changed into a prime (103323000013) 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 23 ways as a sum of consecutive naturals, for example, 1452920 + ... + 1522373.
It is an arithmetic number, because the mean of its divisors is an integer number (5539997428).
Almost surely, 2103323000011 is an apocalyptic number.
103323000011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
103323000011 is a deficient number, since it is larger than the sum of its proper divisors (29636938261).
103323000011 is a wasteful number, since it uses less digits than its factorization.
103323000011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2975363 (or 2975352 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 103323000011 its reverse (110000323301), we get a palindrome (213323323312).
The spelling of 103323000011 in words is "one hundred three billion, three hundred twenty-three million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •