Base | Representation |
---|---|
bin | 10011011010010100… |
… | …01010000111011101 |
3 | 222220021112121022002 |
4 | 21231022022013131 |
5 | 132320324022023 |
6 | 4442032532045 |
7 | 516151464455 |
oct | 115512120735 |
9 | 28807477262 |
10 | 10421314013 |
11 | 4468618510 |
12 | 202a0b1025 |
13 | ca10822c6 |
14 | 70c0b4d65 |
15 | 40ed81b28 |
hex | 26d28a1dd |
10421314013 has 8 divisors (see below), whose sum is σ = 11369449056. Its totient is φ = 9473302800.
The previous prime is 10421314003. The next prime is 10421314061. The reversal of 10421314013 is 31041312401.
10421314013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10421314013 - 210 = 10421312989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10421314003) 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 7 ways as a sum of consecutive naturals, for example, 287495 + ... + 321707.
It is an arithmetic number, because the mean of its divisors is an integer number (1421181132).
Almost surely, 210421314013 is an apocalyptic number.
It is an amenable number.
10421314013 is a deficient number, since it is larger than the sum of its proper divisors (948135043).
10421314013 is a wasteful number, since it uses less digits than its factorization.
10421314013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61915.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10421314013 its reverse (31041312401), we get a palindrome (41462626414).
The spelling of 10421314013 in words is "ten billion, four hundred twenty-one million, three hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •