Base | Representation |
---|---|
bin | 1001010010000011000100… |
… | …00101111101011010100000 |
3 | 2200021022012201000202210020 |
4 | 10221001202011331122200 |
5 | 10133404401030220112 |
6 | 111224500302233440 |
7 | 4204445536035621 |
oct | 451014205753240 |
9 | 80238181022706 |
10 | 20411330320032 |
11 | 655a43a930593 |
12 | 2357a29285880 |
13 | b50a1b102052 |
14 | 507cb1117a48 |
15 | 255e2b31b48c |
hex | 12906217d6a0 |
20411330320032 has 48 divisors (see below), whose sum is σ = 53921014372512. Its totient is φ = 6760440610560.
The previous prime is 20411330320019. The next prime is 20411330320049. The reversal of 20411330320032 is 23002303311402.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 20411330319984 and 20411330320011.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 677112394 + ... + 677142537.
It is an arithmetic number, because the mean of its divisors is an integer number (1123354466094).
Almost surely, 220411330320032 is an apocalyptic number.
It is an amenable number.
20411330320032 is an abundant number, since it is smaller than the sum of its proper divisors (33509684052480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20411330320032 is a wasteful number, since it uses less digits than its factorization.
20411330320032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1354255101 (or 1354255093 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 20411330320032 its reverse (23002303311402), we get a palindrome (43413633631434).
The spelling of 20411330320032 in words is "twenty trillion, four hundred eleven billion, three hundred thirty million, three hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •