Base | Representation |
---|---|
bin | 1001001100010000001101… |
… | …10111001101011101001111 |
3 | 2122120021022010222010020020 |
4 | 10212020012313031131033 |
5 | 10122124122143400221 |
6 | 110553212033553223 |
7 | 4154166634514250 |
oct | 446100667153517 |
9 | 78507263863206 |
10 | 20212231231311 |
11 | 6492a60664369 |
12 | 2325323415813 |
13 | b3800b638292 |
14 | 4dc3c494cb27 |
15 | 250b77003ac6 |
hex | 126206dcd74f |
20212231231311 has 32 divisors (see below), whose sum is σ = 30992761963008. Its totient is φ = 11477426388480.
The previous prime is 20212231231301. The next prime is 20212231231349. The reversal of 20212231231311 is 11313213221202.
It is not a de Polignac number, because 20212231231311 - 215 = 20212231198543 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20212231231301) 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 31 ways as a sum of consecutive naturals, for example, 24990331 + ... + 25786451.
It is an arithmetic number, because the mean of its divisors is an integer number (968523811344).
Almost surely, 220212231231311 is an apocalyptic number.
20212231231311 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20212231231311 is a deficient number, since it is larger than the sum of its proper divisors (10780530731697).
20212231231311 is a wasteful number, since it uses less digits than its factorization.
20212231231311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803711.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 20212231231311 its reverse (11313213221202), we get a palindrome (31525444452513).
The spelling of 20212231231311 in words is "twenty trillion, two hundred twelve billion, two hundred thirty-one million, two hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •