Base | Representation |
---|---|
bin | 10101000110101010… |
… | …10101000010111110 |
3 | 1002020121210101222121 |
4 | 22203111111002332 |
5 | 141201013241110 |
6 | 5112141433154 |
7 | 550526133064 |
oct | 124325250276 |
9 | 32217711877 |
10 | 11330212030 |
11 | 4894677aa5 |
12 | 224256b7ba |
13 | 10b7472a97 |
14 | 796aaa034 |
15 | 464a69cda |
hex | 2a35550be |
11330212030 has 16 divisors (see below), whose sum is σ = 20407054464. Its totient is φ = 4529268640.
The previous prime is 11330212009. The next prime is 11330212051. The reversal of 11330212030 is 3021203311.
11330212030 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (11330212009) and next prime (11330212051).
It is a junction number, because it is equal to n+sod(n) for n = 11330211995 and 11330212013.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 335086 + ... + 367345.
It is an arithmetic number, because the mean of its divisors is an integer number (1275440904).
Almost surely, 211330212030 is an apocalyptic number.
11330212030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11330212030 is a deficient number, since it is larger than the sum of its proper divisors (9076842434).
11330212030 is a wasteful number, since it uses less digits than its factorization.
11330212030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 704051.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 11330212030 its reverse (3021203311), we get a palindrome (14351415341).
The spelling of 11330212030 in words is "eleven billion, three hundred thirty million, two hundred twelve thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •