Base | Representation |
---|---|
bin | 1100101001100011001110001… |
… | …0111101101011000010010101 |
3 | 11022201121200112001001010120020 |
4 | 3022120303202331223002111 |
5 | 1413132030300042010401 |
6 | 12433034521002055353 |
7 | 355326216555031614 |
oct | 31230634275530225 |
9 | 4281550461033506 |
10 | 890110010110101 |
11 | 238686598650410 |
12 | 839b93494aa559 |
13 | 2c2890243b2b21 |
14 | 119b37a922b87b |
15 | 6cd8c0da2bd36 |
hex | 3298ce2f6b095 |
890110010110101 has 32 divisors (see below), whose sum is σ = 1330896516854400. Its totient is φ = 524407303054080.
The previous prime is 890110010109977. The next prime is 890110010110121. The reversal of 890110010110101 is 101011010011098.
890110010110101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 890110010110101 - 218 = 890110009847957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (890110010110121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 327320766 + ... + 330028943.
It is an arithmetic number, because the mean of its divisors is an integer number (41590516151700).
Almost surely, 2890110010110101 is an apocalyptic number.
It is an amenable number.
890110010110101 is a deficient number, since it is larger than the sum of its proper divisors (440786506744299).
890110010110101 is a wasteful number, since it uses less digits than its factorization.
890110010110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 657350869.
The product of its (nonzero) digits is 72, while the sum is 24.
Adding to 890110010110101 its reverse (101011010011098), we get a palindrome (991121020121199).
The spelling of 890110010110101 in words is "eight hundred ninety trillion, one hundred ten billion, ten million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •