Base | Representation |
---|---|
bin | 1001010010000001101001… |
… | …00011111001000011001100 |
3 | 2200021020020110121100110020 |
4 | 10221000310203321003030 |
5 | 10133401320000231130 |
6 | 111224252413142140 |
7 | 4204420601663121 |
oct | 451006443710314 |
9 | 80236213540406 |
10 | 20410566414540 |
11 | 655a088703035 |
12 | 235785548a950 |
13 | b50928a79173 |
14 | 507c3b8a6748 |
15 | 255dd4223e10 |
hex | 1290348f90cc |
20410566414540 has 48 divisors (see below), whose sum is σ = 58002564867072. Its totient is φ = 5361581624256.
The previous prime is 20410566414529. The next prime is 20410566414593. The reversal of 20410566414540 is 4541466501402.
It is a happy number.
It is a super-2 number, since 2×204105664145402 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20410566414492 and 20410566414501.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2538623644 + ... + 2538631683.
It is an arithmetic number, because the mean of its divisors is an integer number (1208386768064).
Almost surely, 220410566414540 is an apocalyptic number.
20410566414540 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20410566414540 is an abundant number, since it is smaller than the sum of its proper divisors (37591998452532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20410566414540 is a wasteful number, since it uses less digits than its factorization.
20410566414540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5077255406 (or 5077255404 counting only the distinct ones).
The product of its (nonzero) digits is 460800, while the sum is 42.
The spelling of 20410566414540 in words is "twenty trillion, four hundred ten billion, five hundred sixty-six million, four hundred fourteen thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •