Base | Representation |
---|---|
bin | 1010001101101111100011… |
… | …1001011101000000001010 |
3 | 1110202200202001111001200200 |
4 | 2203123320321131000022 |
5 | 2433003014400303224 |
6 | 35515315033313030 |
7 | 2236300052405226 |
oct | 243337071350012 |
9 | 43680661431620 |
10 | 11231220322314 |
11 | 3640152090383 |
12 | 1314828b65776 |
13 | 63613a896815 |
14 | 2ab845ba1786 |
15 | 14723a9595c9 |
hex | a36f8e5d00a |
11231220322314 has 24 divisors (see below), whose sum is σ = 24334676795520. Its totient is φ = 3743683784808.
The previous prime is 11231220322313. The next prime is 11231220322391. The reversal of 11231220322314 is 41322302213211.
11231220322314 is a `hidden beast` number, since 1 + 1 + 2 + 3 + 1 + 2 + 20 + 322 + 314 = 666.
It is a super-2 number, since 2×112312203223142 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11231220322313) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3455034 + ... + 5865125.
It is an arithmetic number, because the mean of its divisors is an integer number (1013944866480).
Almost surely, 211231220322314 is an apocalyptic number.
11231220322314 is an abundant number, since it is smaller than the sum of its proper divisors (13103456473206).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11231220322314 is a wasteful number, since it uses less digits than its factorization.
11231220322314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9387114 (or 9387111 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 11231220322314 its reverse (41322302213211), we get a palindrome (52553522535525).
The spelling of 11231220322314 in words is "eleven trillion, two hundred thirty-one billion, two hundred twenty million, three hundred twenty-two thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •