Base | Representation |
---|---|
bin | 10010110101001101… |
… | …11110011001100101 |
3 | 222002120221100102122 |
4 | 21122212332121211 |
5 | 131201141213333 |
6 | 4351114315325 |
7 | 505352304251 |
oct | 113246763145 |
9 | 28076840378 |
10 | 10110101093 |
11 | 4318985654 |
12 | 1b61a28b45 |
13 | c51759851 |
14 | 6bca23261 |
15 | 3e28aa798 |
hex | 25a9be665 |
10110101093 has 8 divisors (see below), whose sum is σ = 10706478912. Its totient is φ = 9513908416.
The previous prime is 10110101033. The next prime is 10110101123. The reversal of 10110101093 is 39010101101.
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 10110101093 - 210 = 10110100069 is a prime.
It is a super-2 number, since 2×101101010932 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10110101033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75296 + ... + 160902.
It is an arithmetic number, because the mean of its divisors is an integer number (1338309864).
Almost surely, 210110101093 is an apocalyptic number.
It is an amenable number.
10110101093 is a deficient number, since it is larger than the sum of its proper divisors (596377819).
10110101093 is an equidigital number, since it uses as much as digits as its factorization.
10110101093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92571.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 10110101093 its reverse (39010101101), we get a palindrome (49120202194).
The spelling of 10110101093 in words is "ten billion, one hundred ten million, one hundred one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.313 sec. • engine limits •