Base | Representation |
---|---|
bin | 1100001110011001011… |
… | …0100101110110110001 |
3 | 202002002212112112110222 |
4 | 3003212112211312301 |
5 | 11420111404041423 |
6 | 240252220102425 |
7 | 21113365666133 |
oct | 3034626456661 |
9 | 662085475428 |
10 | 210023112113 |
11 | 81085631731 |
12 | 34854394a15 |
13 | 16a60a3c449 |
14 | a24533d053 |
15 | 56e339a3c8 |
hex | 30e65a5db1 |
210023112113 has 4 divisors (see below), whose sum is σ = 210039634788. Its totient is φ = 210006589440.
The previous prime is 210023112073. The next prime is 210023112127. The reversal of 210023112113 is 311211320012.
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 107838678544 + 102184433569 = 328388^2 + 319663^2 .
It is a cyclic number.
It is not a de Polignac number, because 210023112113 - 214 = 210023095729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210023112091 and 210023112100.
It is not an unprimeable number, because it can be changed into a prime (210023142113) 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, 8242256 + ... + 8267697.
It is an arithmetic number, because the mean of its divisors is an integer number (52509908697).
Almost surely, 2210023112113 is an apocalyptic number.
It is an amenable number.
210023112113 is a deficient number, since it is larger than the sum of its proper divisors (16522675).
210023112113 is a wasteful number, since it uses less digits than its factorization.
210023112113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16522674.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 210023112113 its reverse (311211320012), we get a palindrome (521234432125).
The spelling of 210023112113 in words is "two hundred ten billion, twenty-three million, one hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •