Base | Representation |
---|---|
bin | 10100100001101101… |
… | …10101111001000101 |
3 | 1001110000111200212120 |
4 | 22100312311321011 |
5 | 140032134331323 |
6 | 5021305440153 |
7 | 540043261026 |
oct | 122066657105 |
9 | 31400450776 |
10 | 11020230213 |
11 | 47456a6083 |
12 | 21767a0059 |
13 | 106818b7a5 |
14 | 767858c4d |
15 | 4477385e3 |
hex | 290db5e45 |
11020230213 has 16 divisors (see below), whose sum is σ = 14730667776. Its totient is φ = 7328330240.
The previous prime is 11020230191. The next prime is 11020230233. The reversal of 11020230213 is 31203202011.
11020230213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11020230213 - 210 = 11020229189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020230192 and 11020230201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11020230233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2928253 + ... + 2932013.
It is an arithmetic number, because the mean of its divisors is an integer number (920666736).
Almost surely, 211020230213 is an apocalyptic number.
It is an amenable number.
11020230213 is a deficient number, since it is larger than the sum of its proper divisors (3710437563).
11020230213 is a wasteful number, since it uses less digits than its factorization.
11020230213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5964.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 11020230213 its reverse (31203202011), we get a palindrome (42223432224).
The spelling of 11020230213 in words is "eleven billion, twenty million, two hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •