Base | Representation |
---|---|
bin | 10010101010101001… |
… | …01011111111100111 |
3 | 221212102001221020220 |
4 | 21111110223333213 |
5 | 131010440433111 |
6 | 4334225455423 |
7 | 503224446636 |
oct | 112524537747 |
9 | 27772057226 |
10 | 10021421031 |
11 | 4282915a46 |
12 | 1b381a1573 |
13 | c3927a63b |
14 | 6b0d3b51d |
15 | 3d9bdee06 |
hex | 25552bfe7 |
10021421031 has 4 divisors (see below), whose sum is σ = 13361894712. Its totient is φ = 6680947352.
The previous prime is 10021420979. The next prime is 10021421041. The reversal of 10021421031 is 13012412001.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13012412001 = 3 ⋅4337470667.
It is a cyclic number.
It is not a de Polignac number, because 10021421031 - 211 = 10021418983 is a prime.
It is a super-2 number, since 2×100214210312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10021421031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021421041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1670236836 + ... + 1670236841.
It is an arithmetic number, because the mean of its divisors is an integer number (3340473678).
Almost surely, 210021421031 is an apocalyptic number.
10021421031 is a deficient number, since it is larger than the sum of its proper divisors (3340473681).
10021421031 is an equidigital number, since it uses as much as digits as its factorization.
10021421031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3340473680.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10021421031 its reverse (13012412001), we get a palindrome (23033833032).
The spelling of 10021421031 in words is "ten billion, twenty-one million, four hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •