Base | Representation |
---|---|
bin | 10011111100010010… |
… | …011010111000001111 |
3 | 2001021021111120012212 |
4 | 103330102122320033 |
5 | 322323103300203 |
6 | 13500425221035 |
7 | 1355423503565 |
oct | 237422327017 |
9 | 61237446185 |
10 | 21412556303 |
11 | 9098914526 |
12 | 419703177b |
13 | 2033231678 |
14 | 1071b45a35 |
15 | 854c911d8 |
hex | 4fc49ae0f |
21412556303 has 8 divisors (see below), whose sum is σ = 21467937168. Its totient is φ = 21357245824.
The previous prime is 21412556287. The next prime is 21412556317. The reversal of 21412556303 is 30365521412.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21412556303 - 24 = 21412556287 is a prime.
It is a super-3 number, since 3×214125563033 (a number of 32 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21412556303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21412550303) 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 7 ways as a sum of consecutive naturals, for example, 621200 + ... + 654762.
It is an arithmetic number, because the mean of its divisors is an integer number (2683492146).
Almost surely, 221412556303 is an apocalyptic number.
21412556303 is a deficient number, since it is larger than the sum of its proper divisors (55380865).
21412556303 is an equidigital number, since it uses as much as digits as its factorization.
21412556303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35193.
The product of its (nonzero) digits is 21600, while the sum is 32.
The spelling of 21412556303 in words is "twenty-one billion, four hundred twelve million, five hundred fifty-six thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •