Base | Representation |
---|---|
bin | 10011000000000110… |
… | …10101000101100011 |
3 | 222022221202211121020 |
4 | 21200003111011203 |
5 | 131343030421011 |
6 | 4404135500523 |
7 | 510541432440 |
oct | 114003250543 |
9 | 28287684536 |
10 | 10201420131 |
11 | 4365487a31 |
12 | 1b88527743 |
13 | c67650c96 |
14 | 6cabd49c7 |
15 | 3ea8e8006 |
hex | 2600d5163 |
10201420131 has 32 divisors (see below), whose sum is σ = 16377792000. Its totient is φ = 5517642240.
The previous prime is 10201420123. The next prime is 10201420133. The reversal of 10201420131 is 13102410201.
It is not a de Polignac number, because 10201420131 - 23 = 10201420123 is a prime.
It is a super-2 number, since 2×102014201312 (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 10201420131.
It is not an unprimeable number, because it can be changed into a prime (10201420133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 460395 + ... + 482043.
It is an arithmetic number, because the mean of its divisors is an integer number (511806000).
Almost surely, 210201420131 is an apocalyptic number.
10201420131 is a deficient number, since it is larger than the sum of its proper divisors (6176371869).
10201420131 is a wasteful number, since it uses less digits than its factorization.
10201420131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22859.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 10201420131 its reverse (13102410201), we get a palindrome (23303830332).
The spelling of 10201420131 in words is "ten billion, two hundred one million, four hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •