Base | Representation |
---|---|
bin | 10100101011111000… |
… | …010001111000111001 |
3 | 2010022220221012220220 |
4 | 110223320101320321 |
5 | 330442004310410 |
6 | 14111551010253 |
7 | 1414260320334 |
oct | 245370217071 |
9 | 63286835826 |
10 | 22211010105 |
11 | 94685996a9 |
12 | 437a509989 |
13 | 212c79283b |
14 | 1109bcb61b |
15 | 89ee10070 |
hex | 52be11e39 |
22211010105 has 8 divisors (see below), whose sum is σ = 35537616192. Its totient is φ = 11845872048.
The previous prime is 22211010083. The next prime is 22211010109. The reversal of 22211010105 is 50101011222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22211010105 - 224 = 22194232889 is a prime.
It is a super-2 number, since 2×222110101052 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 1480734007 = 22211010105 / (2 + 2 + 2 + 1 + 1 + 0 + 1 + 0 + 1 + 0 + 5).
It is not an unprimeable number, because it can be changed into a prime (22211010109) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 740366989 + ... + 740367018.
It is an arithmetic number, because the mean of its divisors is an integer number (4442202024).
Almost surely, 222211010105 is an apocalyptic number.
It is an amenable number.
22211010105 is a deficient number, since it is larger than the sum of its proper divisors (13326606087).
22211010105 is a wasteful number, since it uses less digits than its factorization.
22211010105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1480734015.
The product of its (nonzero) digits is 40, while the sum is 15.
Adding to 22211010105 its reverse (50101011222), we get a palindrome (72312021327).
The spelling of 22211010105 in words is "twenty-two billion, two hundred eleven million, ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •