Base | Representation |
---|---|
bin | 110011001110100011… |
… | …0110110101001100101 |
3 | 101111221210020010120022 |
4 | 1212131012312221211 |
5 | 3300300030031041 |
6 | 122312104044525 |
7 | 10643102405603 |
oct | 1463506665145 |
9 | 344853203508 |
10 | 110010002021 |
11 | 42722861847 |
12 | 193a2163745 |
13 | a4b25bc66a |
14 | 5478668873 |
15 | 2cdce2124b |
hex | 199d1b6a65 |
110010002021 has 4 divisors (see below), whose sum is σ = 112693172844. Its totient is φ = 107326831200.
The previous prime is 110010001991. The next prime is 110010002023. The reversal of 110010002021 is 120200010011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 120200010011 = 125423 ⋅958357.
It can be written as a sum of positive squares in 2 ways, for example, as 5623500100 + 104386501921 = 74990^2 + 323089^2 .
It is a cyclic number.
It is not a de Polignac number, because 110010002021 - 226 = 109942893157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110010002023) 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, 1341585350 + ... + 1341585431.
It is an arithmetic number, because the mean of its divisors is an integer number (28173293211).
Almost surely, 2110010002021 is an apocalyptic number.
It is an amenable number.
110010002021 is a deficient number, since it is larger than the sum of its proper divisors (2683170823).
110010002021 is an equidigital number, since it uses as much as digits as its factorization.
110010002021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2683170822.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 110010002021 its reverse (120200010011), we get a palindrome (230210012032).
The spelling of 110010002021 in words is "one hundred ten billion, ten million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •