Base | Representation |
---|---|
bin | 1001010011000001000111… |
… | …0000111101110100111111 |
3 | 1100012020121001221020212212 |
4 | 2110300101300331310333 |
5 | 2314440302433311221 |
6 | 33424022530451035 |
7 | 2103352424104433 |
oct | 224602160756477 |
9 | 40166531836785 |
10 | 10222320213311 |
11 | 32912972a08a8 |
12 | 11911a2433a7b |
13 | 591c647539bb |
14 | 274a977069c3 |
15 | 12ad8cb98b5b |
hex | 94c11c3dd3f |
10222320213311 has 4 divisors (see below), whose sum is σ = 10574814013800. Its totient is φ = 9869826412824.
The previous prime is 10222320213293. The next prime is 10222320213331. The reversal of 10222320213311 is 11331202322201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10222320213311 - 238 = 9947442306367 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222320213331) 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 3 ways as a sum of consecutive naturals, for example, 176246900201 + ... + 176246900258.
It is an arithmetic number, because the mean of its divisors is an integer number (2643703503450).
Almost surely, 210222320213311 is an apocalyptic number.
10222320213311 is a deficient number, since it is larger than the sum of its proper divisors (352493800489).
10222320213311 is an equidigital number, since it uses as much as digits as its factorization.
10222320213311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 352493800488.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10222320213311 its reverse (11331202322201), we get a palindrome (21553522535512).
The spelling of 10222320213311 in words is "ten trillion, two hundred twenty-two billion, three hundred twenty million, two hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •