Base | Representation |
---|---|
bin | 1010010011000010100110… |
… | …0000001101100011001111 |
3 | 1111002101122200102220102220 |
4 | 2210300221200031203033 |
5 | 2441000411401232343 |
6 | 40025205524550423 |
7 | 2246001262644435 |
oct | 244605140154317 |
9 | 44071580386386 |
10 | 11322230102223 |
11 | 36758047a5017 |
12 | 132a3a7b52413 |
13 | 6418b296b5b1 |
14 | 2b1ddac34d55 |
15 | 1497b579a183 |
hex | a4c2980d8cf |
11322230102223 has 32 divisors (see below), whose sum is σ = 15535524903360. Its totient is φ = 7329370199040.
The previous prime is 11322230102219. The next prime is 11322230102273. The reversal of 11322230102223 is 32220103222311.
It is not a de Polignac number, because 11322230102223 - 22 = 11322230102219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11322230102193 and 11322230102202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11322230102273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 500153461 + ... + 500176097.
It is an arithmetic number, because the mean of its divisors is an integer number (485485153230).
Almost surely, 211322230102223 is an apocalyptic number.
11322230102223 is a deficient number, since it is larger than the sum of its proper divisors (4213294801137).
11322230102223 is a wasteful number, since it uses less digits than its factorization.
11322230102223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31547.
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 11322230102223 its reverse (32220103222311), we get a palindrome (43542333324534).
The spelling of 11322230102223 in words is "eleven trillion, three hundred twenty-two billion, two hundred thirty million, one hundred two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •