Base | Representation |
---|---|
bin | 10011011010010100… |
… | …00111000110001101 |
3 | 222220021111222100000 |
4 | 21231022013012031 |
5 | 132320323123040 |
6 | 4442032354513 |
7 | 516151413426 |
oct | 115512070615 |
9 | 28807458300 |
10 | 10421301645 |
11 | 446860a197 |
12 | 202a0a5a39 |
13 | ca10797a1 |
14 | 70c0b064d |
15 | 40ed7d130 |
hex | 26d28718d |
10421301645 has 48 divisors (see below), whose sum is σ = 18789930432. Its totient is φ = 5541022080.
The previous prime is 10421301643. The next prime is 10421301673. The reversal of 10421301645 is 54610312401.
It is a happy number.
10421301645 is a `hidden beast` number, since 1 + 0 + 4 + 2 + 13 + 0 + 1 + 645 = 666.
It is not a de Polignac number, because 10421301645 - 21 = 10421301643 is a prime.
It is a super-3 number, since 3×104213016453 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10421301643) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 389209 + ... + 415121.
It is an arithmetic number, because the mean of its divisors is an integer number (391456884).
Almost surely, 210421301645 is an apocalyptic number.
10421301645 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10421301645 is a deficient number, since it is larger than the sum of its proper divisors (8368628787).
10421301645 is an equidigital number, since it uses as much as digits as its factorization.
10421301645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26264 (or 26252 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The spelling of 10421301645 in words is "ten billion, four hundred twenty-one million, three hundred one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •