Base | Representation |
---|---|
bin | 1010001101101011110011… |
… | …1000000011101001000100 |
3 | 1110202121010212122012210002 |
4 | 2203122330320003221010 |
5 | 2432443434102321312 |
6 | 35515031102020432 |
7 | 2236233104144153 |
oct | 243327470035104 |
9 | 43677125565702 |
10 | 11230213323332 |
11 | 363a785717113 |
12 | 13145a7877718 |
13 | 63600a078a33 |
14 | 2ab78c15159a |
15 | 1471cc3444c2 |
hex | a36bce03a44 |
11230213323332 has 12 divisors (see below), whose sum is σ = 19665087667260. Its totient is φ = 5611616846976.
The previous prime is 11230213323317. The next prime is 11230213323341. The reversal of 11230213323332 is 23332331203211.
It can be written as a sum of positive squares in 2 ways, for example, as 11130190405636 + 100022917696 = 3336194^2 + 316264^2 .
It is a super-2 number, since 2×112302133233322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11230213323295 and 11230213323304.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 872446433 + ... + 872459304.
It is an arithmetic number, because the mean of its divisors is an integer number (1638757305605).
Almost surely, 211230213323332 is an apocalyptic number.
It is an amenable number.
11230213323332 is a deficient number, since it is larger than the sum of its proper divisors (8434874343928).
11230213323332 is a wasteful number, since it uses less digits than its factorization.
11230213323332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1744907350 (or 1744907348 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 11230213323332 its reverse (23332331203211), we get a palindrome (34562544526543).
The spelling of 11230213323332 in words is "eleven trillion, two hundred thirty billion, two hundred thirteen million, three hundred twenty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •