Base | Representation |
---|---|
bin | 10010110111101110… |
… | …01000000001010101 |
3 | 222011001110211000011 |
4 | 21123313020001111 |
5 | 131222031041041 |
6 | 4353144520221 |
7 | 506026013512 |
oct | 113367100125 |
9 | 28131424004 |
10 | 10131112021 |
11 | 4329826458 |
12 | 1b68a80071 |
13 | c55c05154 |
14 | 6c1732309 |
15 | 3e465ae81 |
hex | 25bdc8055 |
10131112021 has 4 divisors (see below), whose sum is σ = 10322265132. Its totient is φ = 9939958912.
The previous prime is 10131112003. The next prime is 10131112031. The reversal of 10131112021 is 12021113101.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4371060996 + 5760051025 = 66114^2 + 75895^2 .
It is a cyclic number.
It is not a de Polignac number, because 10131112021 - 29 = 10131111509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10131111992 and 10131112010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131112031) 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, 95576476 + ... + 95576581.
It is an arithmetic number, because the mean of its divisors is an integer number (2580566283).
Almost surely, 210131112021 is an apocalyptic number.
It is an amenable number.
10131112021 is a deficient number, since it is larger than the sum of its proper divisors (191153111).
10131112021 is an equidigital number, since it uses as much as digits as its factorization.
10131112021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191153110.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10131112021 its reverse (12021113101), we get a palindrome (22152225122).
The spelling of 10131112021 in words is "ten billion, one hundred thirty-one million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •