Base | Representation |
---|---|
bin | 10101000110110011… |
… | …00110010010011110 |
3 | 1002020200220021020110 |
4 | 22203121212102132 |
5 | 141201310044410 |
6 | 5112221430450 |
7 | 550541504052 |
oct | 124331462236 |
9 | 32220807213 |
10 | 11331331230 |
11 | 489527195a |
12 | 2242a0b426 |
13 | 10b777532b |
14 | 796cbbc62 |
15 | 464bdb720 |
hex | 2a366649e |
11331331230 has 16 divisors (see below), whose sum is σ = 27195195024. Its totient is φ = 3021688320.
The previous prime is 11331331213. The next prime is 11331331243. The reversal of 11331331230 is 3213313311.
11331331230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11331331197 and 11331331206.
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, 188855491 + ... + 188855550.
It is an arithmetic number, because the mean of its divisors is an integer number (1699699689).
Almost surely, 211331331230 is an apocalyptic number.
11331331230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11331331230 is an abundant number, since it is smaller than the sum of its proper divisors (15863863794).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11331331230 is a wasteful number, since it uses less digits than its factorization.
11331331230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377711051.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 11331331230 its reverse (3213313311), we get a palindrome (14544644541).
The spelling of 11331331230 in words is "eleven billion, three hundred thirty-one million, three hundred thirty-one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •