Base | Representation |
---|---|
bin | 10010101111111001… |
… | …101101011101110101 |
3 | 1220221222001021202120 |
4 | 102233321231131311 |
5 | 312212014313141 |
6 | 13125325230153 |
7 | 1311602523324 |
oct | 225771553565 |
9 | 56858037676 |
10 | 20131010421 |
11 | 85a04810a5 |
12 | 3a99a02359 |
13 | 1b8a8882b2 |
14 | d8d86a0bb |
15 | 7cc4e8c66 |
hex | 4afe6d775 |
20131010421 has 16 divisors (see below), whose sum is σ = 27155325120. Its totient is φ = 13264300800.
The previous prime is 20131010401. The next prime is 20131010441. The reversal of 20131010421 is 12401013102.
It is an interprime number because it is at equal distance from previous prime (20131010401) and next prime (20131010441).
It is not a de Polignac number, because 20131010421 - 27 = 20131010293 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20131010421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20131010401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54366 + ... + 207888.
It is an arithmetic number, because the mean of its divisors is an integer number (1697207820).
Almost surely, 220131010421 is an apocalyptic number.
It is an amenable number.
20131010421 is a deficient number, since it is larger than the sum of its proper divisors (7024314699).
20131010421 is a wasteful number, since it uses less digits than its factorization.
20131010421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154036.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 20131010421 its reverse (12401013102), we get a palindrome (32532023523).
The spelling of 20131010421 in words is "twenty billion, one hundred thirty-one million, ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •