Base | Representation |
---|---|
bin | 10101000101100101… |
… | …11101001010110010 |
3 | 1002012222211121121222 |
4 | 22202302331022302 |
5 | 141141211420310 |
6 | 5111220345042 |
7 | 550356423605 |
oct | 124262751262 |
9 | 32188747558 |
10 | 11321201330 |
11 | 488a58313a |
12 | 223b545182 |
13 | 10b56395ca |
14 | 79580233c |
15 | 463d8a055 |
hex | 2a2cbd2b2 |
11321201330 has 8 divisors (see below), whose sum is σ = 20378162412. Its totient is φ = 4528480528.
The previous prime is 11321201329. The next prime is 11321201347. The reversal of 11321201330 is 3310212311.
11321201330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 11027730169 + 293471161 = 105013^2 + 17131^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11321201299 and 11321201308.
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 3 ways as a sum of consecutive naturals, for example, 566060057 + ... + 566060076.
Almost surely, 211321201330 is an apocalyptic number.
11321201330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11321201330 is a deficient number, since it is larger than the sum of its proper divisors (9056961082).
11321201330 is a wasteful number, since it uses less digits than its factorization.
11321201330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1132120140.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 11321201330 its reverse (3310212311), we get a palindrome (14631413641).
The spelling of 11321201330 in words is "eleven billion, three hundred twenty-one million, two hundred one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •