Base | Representation |
---|---|
bin | 1001010000001010100100… |
… | …10101101111001001101101 |
3 | 2200001010020102121210021000 |
4 | 10220011102111233021231 |
5 | 10131324410211323041 |
6 | 111135041300430513 |
7 | 4166665513163040 |
oct | 450052225571155 |
9 | 80033212553230 |
10 | 20346641511021 |
11 | 6534a64773961 |
12 | 23473950a8439 |
13 | b478ac131a77 |
14 | 504ad5a4ac57 |
15 | 2543e2131bb6 |
hex | 12815256f26d |
20346641511021 has 32 divisors (see below), whose sum is σ = 34463593831680. Its totient is φ = 11621841666048.
The previous prime is 20346641510963. The next prime is 20346641511023. The reversal of 20346641511021 is 12011514664302.
20346641511021 is a `hidden beast` number, since 2 + 0 + 3 + 4 + 6 + 641 + 5 + 1 + 1 + 0 + 2 + 1 = 666.
It is not a de Polignac number, because 20346641511021 - 27 = 20346641510893 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20346641511023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21813396 + ... + 22727021.
It is an arithmetic number, because the mean of its divisors is an integer number (1076987307240).
Almost surely, 220346641511021 is an apocalyptic number.
20346641511021 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20346641511021 is a deficient number, since it is larger than the sum of its proper divisors (14116952320659).
20346641511021 is a wasteful number, since it uses less digits than its factorization.
20346641511021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44542850 (or 44542844 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 20346641511021 in words is "twenty trillion, three hundred forty-six billion, six hundred forty-one million, five hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •