Base | Representation |
---|---|
bin | 10010110100000010… |
… | …001011111011101111 |
3 | 1221010210111122202100 |
4 | 102310002023323233 |
5 | 312332241404411 |
6 | 13140243230143 |
7 | 1313404032060 |
oct | 226402137357 |
9 | 57123448670 |
10 | 20200341231 |
11 | 8626625394 |
12 | 3ab9078353 |
13 | 1b9c051345 |
14 | d98b56567 |
15 | 7d3641456 |
hex | 4b408beef |
20200341231 has 12 divisors (see below), whose sum is σ = 33346595152. Its totient is φ = 11543052096.
The previous prime is 20200341223. The next prime is 20200341251. The reversal of 20200341231 is 13214300202.
20200341231 is a `hidden beast` number, since 20 + 200 + 3 + 412 + 31 = 666.
It is not a de Polignac number, because 20200341231 - 23 = 20200341223 is a prime.
It is a super-2 number, since 2×202003412312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20200341251) 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 11 ways as a sum of consecutive naturals, for example, 160320106 + ... + 160320231.
Almost surely, 220200341231 is an apocalyptic number.
20200341231 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20200341231 is a deficient number, since it is larger than the sum of its proper divisors (13146253921).
20200341231 is a wasteful number, since it uses less digits than its factorization.
20200341231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 320640350 (or 320640347 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 20200341231 its reverse (13214300202), we get a palindrome (33414641433).
The spelling of 20200341231 in words is "twenty billion, two hundred million, three hundred forty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •