Base | Representation |
---|---|
bin | 110011010001010001… |
… | …0110100111010010101 |
3 | 101112012010212112111111 |
4 | 1212202202310322111 |
5 | 3300441403033023 |
6 | 122325123135021 |
7 | 10645260636310 |
oct | 1464242647225 |
9 | 345163775444 |
10 | 110101221013 |
11 | 4276a2a5a43 |
12 | 19408814471 |
13 | a4c847a3b4 |
14 | 5486811977 |
15 | 2ce5e3e00d |
hex | 19a28b4e95 |
110101221013 has 16 divisors (see below), whose sum is σ = 126148647424. Its totient is φ = 94133612160.
The previous prime is 110101220941. The next prime is 110101221017. The reversal of 110101221013 is 310122101011.
It is a happy number.
It is not a de Polignac number, because 110101221013 - 213 = 110101212821 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110101220984 and 110101221002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110101221017) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16525903 + ... + 16532563.
It is an arithmetic number, because the mean of its divisors is an integer number (7884290464).
Almost surely, 2110101221013 is an apocalyptic number.
It is an amenable number.
110101221013 is a deficient number, since it is larger than the sum of its proper divisors (16047426411).
110101221013 is an equidigital number, since it uses as much as digits as its factorization.
110101221013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12292.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 110101221013 its reverse (310122101011), we get a palindrome (420223322024).
The spelling of 110101221013 in words is "one hundred ten billion, one hundred one million, two hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •