Base | Representation |
---|---|
bin | 1010001100101100000110… |
… | …0011101110111000100011 |
3 | 1110200222000001111121021212 |
4 | 2203023001203232320203 |
5 | 2432203423133343243 |
6 | 35503122121340335 |
7 | 2235056240330444 |
oct | 243130143567043 |
9 | 43628001447255 |
10 | 11213112012323 |
11 | 36334aa451031 |
12 | 13112146376ab |
13 | 6345130a31b0 |
14 | 2aaa08c1d2cb |
15 | 146a2ad09318 |
hex | a32c18eee23 |
11213112012323 has 8 divisors (see below), whose sum is σ = 12075762566448. Its totient is φ = 10350476240544.
The previous prime is 11213112012251. The next prime is 11213112012373. The reversal of 11213112012323 is 32321021131211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11213112012323 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11213112012373) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2094440 + ... + 5178117.
It is an arithmetic number, because the mean of its divisors is an integer number (1509470320806).
Almost surely, 211213112012323 is an apocalyptic number.
11213112012323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11213112012323 is a deficient number, since it is larger than the sum of its proper divisors (862650554125).
11213112012323 is a wasteful number, since it uses less digits than its factorization.
11213112012323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7391173.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11213112012323 its reverse (32321021131211), we get a palindrome (43534133143534).
The spelling of 11213112012323 in words is "eleven trillion, two hundred thirteen billion, one hundred twelve million, twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •