Base | Representation |
---|---|
bin | 10100011111100011… |
… | …01110110010111101 |
3 | 1001101202102021000120 |
4 | 22033301232302331 |
5 | 140013020110323 |
6 | 5015421245153 |
7 | 536433263550 |
oct | 121761566275 |
9 | 31352367016 |
10 | 11002113213 |
11 | 4736451553 |
12 | 21707037b9 |
13 | 10644b7480 |
14 | 7652a0697 |
15 | 445d5a5e3 |
hex | 28fc6ecbd |
11002113213 has 32 divisors (see below), whose sum is σ = 18075730176. Its totient is φ = 5796569088.
The previous prime is 11002113163. The next prime is 11002113233. The reversal of 11002113213 is 31231120011.
It is a happy number.
It is not a de Polignac number, because 11002113213 - 29 = 11002112701 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11002113192 and 11002113201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11002113233) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 216445 + ... + 262397.
It is an arithmetic number, because the mean of its divisors is an integer number (564866568).
Almost surely, 211002113213 is an apocalyptic number.
11002113213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
11002113213 is a deficient number, since it is larger than the sum of its proper divisors (7073616963).
11002113213 is a wasteful number, since it uses less digits than its factorization.
11002113213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46853.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 11002113213 its reverse (31231120011), we get a palindrome (42233233224).
The spelling of 11002113213 in words is "eleven billion, two million, one hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •