Base | Representation |
---|---|
bin | 1010001101001010001111… |
… | …0101111011011010000011 |
3 | 1110201201212221212200221220 |
4 | 2203102203311323122003 |
5 | 2432322011032302243 |
6 | 35510541044050123 |
7 | 2235463611104100 |
oct | 243224365733203 |
9 | 43651787780856 |
10 | 11221203400323 |
11 | 3636981868654 |
12 | 13128b2393943 |
13 | 635202532c47 |
14 | 2ab1756b5aa7 |
15 | 146d51357783 |
hex | a34a3d7b683 |
11221203400323 has 96 divisors (see below), whose sum is σ = 18056168524800. Its totient is φ = 6173256466944.
The previous prime is 11221203400313. The next prime is 11221203400397. The reversal of 11221203400323 is 32300430212211.
It is not a de Polignac number, because 11221203400323 - 216 = 11221203334787 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11221203400293 and 11221203400302.
It is not an unprimeable number, because it can be changed into a prime (11221203400313) by changing a digit.
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 95 ways as a sum of consecutive naturals, for example, 2863280358 + ... + 2863284276.
It is an arithmetic number, because the mean of its divisors is an integer number (188085088800).
Almost surely, 211221203400323 is an apocalyptic number.
11221203400323 is a deficient number, since it is larger than the sum of its proper divisors (6834965124477).
11221203400323 is a wasteful number, since it uses less digits than its factorization.
11221203400323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5721 (or 5714 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 11221203400323 its reverse (32300430212211), we get a palindrome (43521633612534).
The spelling of 11221203400323 in words is "eleven trillion, two hundred twenty-one billion, two hundred three million, four hundred thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •