Base | Representation |
---|---|
bin | 10100010011011101… |
… | …01001000110000011 |
3 | 1001010200110220010021 |
4 | 22021232221012003 |
5 | 134311030441011 |
6 | 5001354314311 |
7 | 534061624633 |
oct | 121156510603 |
9 | 31120426107 |
10 | 10900640131 |
11 | 46941442a7 |
12 | 2142728997 |
13 | 1049479324 |
14 | 755a086c3 |
15 | 43beb4471 |
hex | 289ba9183 |
10900640131 has 4 divisors (see below), whose sum is σ = 10900941552. Its totient is φ = 10900338712.
The previous prime is 10900640123. The next prime is 10900640141. The reversal of 10900640131 is 13104600901.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10900640131 - 23 = 10900640123 is a prime.
It is a super-2 number, since 2×109006401312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10900640096 and 10900640105.
It is not an unprimeable number, because it can be changed into a prime (10900640141) 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, 87676 + ... + 171721.
It is an arithmetic number, because the mean of its divisors is an integer number (2725235388).
Almost surely, 210900640131 is an apocalyptic number.
10900640131 is a deficient number, since it is larger than the sum of its proper divisors (301421).
10900640131 is an equidigital number, since it uses as much as digits as its factorization.
10900640131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 301420.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 10900640131 in words is "ten billion, nine hundred million, six hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •