Base | Representation |
---|---|
bin | 10010110101001110… |
… | …01000001001010101 |
3 | 222002121000101012011 |
4 | 21122213020021111 |
5 | 131201144003023 |
6 | 4351115224221 |
7 | 505352531530 |
oct | 113247101125 |
9 | 28077011164 |
10 | 10110141013 |
11 | 4318a02645 |
12 | 1b61a48071 |
13 | c51771a7b |
14 | 6bca33a17 |
15 | 3e28b750d |
hex | 25a9c8255 |
10110141013 has 8 divisors (see below), whose sum is σ = 11555059520. Its totient is φ = 8665375680.
The previous prime is 10110141007. The next prime is 10110141101. The reversal of 10110141013 is 31014101101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10110141013 - 229 = 9573270101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10110140984 and 10110141002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110141313) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 213853 + ... + 256813.
It is an arithmetic number, because the mean of its divisors is an integer number (1444382440).
Almost surely, 210110141013 is an apocalyptic number.
It is an amenable number.
10110141013 is a deficient number, since it is larger than the sum of its proper divisors (1444918507).
10110141013 is an equidigital number, since it uses as much as digits as its factorization.
10110141013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76587.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 10110141013 its reverse (31014101101), we get a palindrome (41124242114).
The spelling of 10110141013 in words is "ten billion, one hundred ten million, one hundred forty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •