Base | Representation |
---|---|
bin | 110000000011111011… |
… | …1000110101111000000 |
3 | 100212101221220011212211 |
4 | 1200013313012233000 |
5 | 3142334020213440 |
6 | 115225312031504 |
7 | 10312444612231 |
oct | 1400767065700 |
9 | 325357804784 |
10 | 103211101120 |
11 | 3a853a80986 |
12 | 18005232594 |
13 | 996ab6708a |
14 | 4dd16d9088 |
15 | 2a410cbeea |
hex | 1807dc6bc0 |
103211101120 has 28 divisors (see below), whose sum is σ = 245771435304. Its totient is φ = 41284440320.
The previous prime is 103211101111. The next prime is 103211101121. The reversal of 103211101120 is 21101112301.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 103211101120.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103211101121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 161267026 + ... + 161267665.
Almost surely, 2103211101120 is an apocalyptic number.
103211101120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103211101120 is an abundant number, since it is smaller than the sum of its proper divisors (142560334184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103211101120 is an equidigital number, since it uses as much as digits as its factorization.
103211101120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322534708 (or 322534698 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 103211101120 its reverse (21101112301), we get a palindrome (124312213421).
The spelling of 103211101120 in words is "one hundred three billion, two hundred eleven million, one hundred one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •