Base | Representation |
---|---|
bin | 11001000110011… |
… | …011110010101111 |
3 | 1002100101222001202 |
4 | 121012123302233 |
5 | 1330301221403 |
6 | 105442000115 |
7 | 13302302441 |
oct | 3106336257 |
9 | 1070358052 |
10 | 421117103 |
11 | 1a6789570 |
12 | b904603b |
13 | 69326324 |
14 | 3dd00491 |
15 | 26e85688 |
hex | 1919bcaf |
421117103 has 16 divisors (see below), whose sum is σ = 471204096. Its totient is φ = 373040640.
The previous prime is 421117087. The next prime is 421117111. The reversal of 421117103 is 301711124.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 421117103 - 24 = 421117087 is a prime.
It is a super-2 number, since 2×4211171032 = 354679228878225218, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (421117003) 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 15 ways as a sum of consecutive naturals, for example, 272150 + ... + 273692.
It is an arithmetic number, because the mean of its divisors is an integer number (29450256).
Almost surely, 2421117103 is an apocalyptic number.
421117103 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
421117103 is a deficient number, since it is larger than the sum of its proper divisors (50086993).
421117103 is a wasteful number, since it uses less digits than its factorization.
421117103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2174.
The product of its (nonzero) digits is 168, while the sum is 20.
The square root of 421117103 is about 20521.1379557762. The cubic root of 421117103 is about 749.5506066331.
Adding to 421117103 its reverse (301711124), we get a palindrome (722828227).
The spelling of 421117103 in words is "four hundred twenty-one million, one hundred seventeen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •