Base | Representation |
---|---|
bin | 111110101001101… |
… | …1000010000110001 |
3 | 12102111201110022122 |
4 | 1331103120100301 |
5 | 13301132411423 |
6 | 544334044025 |
7 | 103044451412 |
oct | 17523302061 |
9 | 5374643278 |
10 | 2102232113 |
11 | 989723113 |
12 | 4a8049615 |
13 | 2766bcb37 |
14 | 15d2ab809 |
15 | c48588c8 |
hex | 7d4d8431 |
2102232113 has 8 divisors (see below), whose sum is σ = 2142676800. Its totient is φ = 2062088560.
The previous prime is 2102232101. The next prime is 2102232157. The reversal of 2102232113 is 3112322012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2102232113 - 214 = 2102215729 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2102232091 and 2102232100.
It is not an unprimeable number, because it can be changed into a prime (2102232193) 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, 61163 + ... + 89136.
It is an arithmetic number, because the mean of its divisors is an integer number (267834600).
Almost surely, 22102232113 is an apocalyptic number.
It is an amenable number.
2102232113 is a deficient number, since it is larger than the sum of its proper divisors (40444687).
2102232113 is a wasteful number, since it uses less digits than its factorization.
2102232113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150567.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 2102232113 is about 45850.1048308507. The cubic root of 2102232113 is about 1281.0327182032.
Adding to 2102232113 its reverse (3112322012), we get a palindrome (5214554125).
It can be divided in two parts, 21022 and 32113, that added together give a palindrome (53135).
The spelling of 2102232113 in words is "two billion, one hundred two million, two hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •