Base | Representation |
---|---|
bin | 1000001100110100… |
… | …0010101010110101 |
3 | 12200102000021111221 |
4 | 2003031002222311 |
5 | 14002003442401 |
6 | 1002232030341 |
7 | 105356116063 |
oct | 20315025265 |
9 | 5612007457 |
10 | 2201234101 |
11 | a2a5a2840 |
12 | 5152323b1 |
13 | 2910742b1 |
14 | 16c4bd033 |
15 | cd3b27a1 |
hex | 83342ab5 |
2201234101 has 4 divisors (see below), whose sum is σ = 2401346304. Its totient is φ = 2001121900.
The previous prime is 2201234099. The next prime is 2201234111. The reversal of 2201234101 is 1014321022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2201234101 - 21 = 2201234099 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 (2201234111) 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, 100056085 + ... + 100056106.
It is an arithmetic number, because the mean of its divisors is an integer number (600336576).
Almost surely, 22201234101 is an apocalyptic number.
It is an amenable number.
2201234101 is a deficient number, since it is larger than the sum of its proper divisors (200112203).
2201234101 is a wasteful number, since it uses less digits than its factorization.
2201234101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200112202.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 2201234101 is about 46917.3113146949. The cubic root of 2201234101 is about 1300.8345924842.
Adding to 2201234101 its reverse (1014321022), we get a palindrome (3215555123).
It can be divided in two parts, 220 and 1234101, that added together give a palindrome (1234321).
The spelling of 2201234101 in words is "two billion, two hundred one million, two hundred thirty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •