Base | Representation |
---|---|
bin | 1010010010111110110011… |
… | …1000110001011001011010 |
3 | 1111002022000210211101021020 |
4 | 2210233230320301121122 |
5 | 2440441321030132310 |
6 | 40024520555423310 |
7 | 2245634133556005 |
oct | 244575470613132 |
9 | 44068023741236 |
10 | 11321213130330 |
11 | 3675332739a84 |
12 | 132a163454b36 |
13 | 64178006b38c |
14 | 2b1d41b4a53c |
15 | 149756365170 |
hex | a4bece3165a |
11321213130330 has 32 divisors (see below), whose sum is σ = 27424845273024. Its totient is φ = 2990775305856.
The previous prime is 11321213130281. The next prime is 11321213130347. The reversal of 11321213130330 is 3303131212311.
It is a self number, because there is not a number n which added to its sum of digits gives 11321213130330.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1763425627 + ... + 1763432046.
It is an arithmetic number, because the mean of its divisors is an integer number (857026414782).
Almost surely, 211321213130330 is an apocalyptic number.
11321213130330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11321213130330 is an abundant number, since it is smaller than the sum of its proper divisors (16103632142694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11321213130330 is a wasteful number, since it uses less digits than its factorization.
11321213130330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3526857790.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 11321213130330 its reverse (3303131212311), we get a palindrome (14624344342641).
The spelling of 11321213130330 in words is "eleven trillion, three hundred twenty-one billion, two hundred thirteen million, one hundred thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •