Base | Representation |
---|---|
bin | 1001000111010111111110… |
… | …1001100101111100001111 |
3 | 1022111010022100012102222100 |
4 | 2101311333221211330033 |
5 | 2303201132334430221 |
6 | 33152103050050143 |
7 | 2053041642020211 |
oct | 221657751457417 |
9 | 38433270172870 |
10 | 10022300311311 |
11 | 3214485276a72 |
12 | 115a480119953 |
13 | 579139286bc2 |
14 | 269120b245b1 |
15 | 125a82ae2926 |
hex | 91d7fa65f0f |
10022300311311 has 96 divisors (see below), whose sum is σ = 15858092390400. Its totient is φ = 6075229305600.
The previous prime is 10022300311217. The next prime is 10022300311313. The reversal of 10022300311311 is 11311300322001.
10022300311311 is a `hidden beast` number, since 1 + 0 + 0 + 22 + 300 + 31 + 1 + 311 = 666.
It is not a de Polignac number, because 10022300311311 - 27 = 10022300311183 is a prime.
It is a super-3 number, since 3×100223003113113 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10022300311313) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 762087586 + ... + 762100736.
It is an arithmetic number, because the mean of its divisors is an integer number (165188462400).
Almost surely, 210022300311311 is an apocalyptic number.
10022300311311 is a deficient number, since it is larger than the sum of its proper divisors (5835792079089).
10022300311311 is a wasteful number, since it uses less digits than its factorization.
10022300311311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14109 (or 14106 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 10022300311311 its reverse (11311300322001), we get a palindrome (21333600633312).
The spelling of 10022300311311 in words is "ten trillion, twenty-two billion, three hundred million, three hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •