Base | Representation |
---|---|
bin | 1010001101010001110010… |
… | …1001111100011110110100 |
3 | 1110201221010012211222112021 |
4 | 2203110130221330132310 |
5 | 2432340133424132012 |
6 | 35511514131402524 |
7 | 2235565052351602 |
oct | 243243451743664 |
9 | 43657105758467 |
10 | 11223230302132 |
11 | 3637821a09a12 |
12 | 1313179153444 |
13 | 635466439024 |
14 | 2ab2c8974872 |
15 | 146e1e281007 |
hex | a351ca7c7b4 |
11223230302132 has 6 divisors (see below), whose sum is σ = 19640653028738. Its totient is φ = 5611615151064.
The previous prime is 11223230302103. The next prime is 11223230302133. The reversal of 11223230302132 is 23120303232211.
It can be written as a sum of positive squares in only one way, i.e., 9778416686116 + 1444813616016 = 3127046^2 + 1202004^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11223230302097 and 11223230302106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11223230302133) 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 as a sum of consecutive naturals, namely, 1402903787763 + ... + 1402903787770.
Almost surely, 211223230302132 is an apocalyptic number.
It is an amenable number.
11223230302132 is a deficient number, since it is larger than the sum of its proper divisors (8417422726606).
11223230302132 is a wasteful number, since it uses less digits than its factorization.
11223230302132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2805807575537 (or 2805807575535 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 11223230302132 its reverse (23120303232211), we get a palindrome (34343533534343).
The spelling of 11223230302132 in words is "eleven trillion, two hundred twenty-three billion, two hundred thirty million, three hundred two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •