Base | Representation |
---|---|
bin | 1001000110011110010101… |
… | …01110001010101011100000 |
3 | 2121212021201221100221220220 |
4 | 10203033022232022223200 |
5 | 10110400430323411224 |
6 | 110322051241003040 |
7 | 4133636665565616 |
oct | 443171256125340 |
9 | 77767657327826 |
10 | 20013653732064 |
11 | 6416819860023 |
12 | 22b2944183480 |
13 | b22382c45335 |
14 | 4d29477596b6 |
15 | 24a9038bb279 |
hex | 1233cab8aae0 |
20013653732064 has 48 divisors (see below), whose sum is σ = 53817203034000. Its totient is φ = 6508505277440.
The previous prime is 20013653732047. The next prime is 20013653732081. The reversal of 20013653732064 is 46023735631002.
It is an interprime number because it is at equal distance from previous prime (20013653732047) and next prime (20013653732081).
It is a tau number, because it is divible by the number of its divisors (48).
It is a congruent number.
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, 2542380939 + ... + 2542388810.
It is an arithmetic number, because the mean of its divisors is an integer number (1121191729875).
Almost surely, 220013653732064 is an apocalyptic number.
20013653732064 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
20013653732064 is an abundant number, since it is smaller than the sum of its proper divisors (33803549301936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20013653732064 is a wasteful number, since it uses less digits than its factorization.
20013653732064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5084769803 (or 5084769795 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 42.
The spelling of 20013653732064 in words is "twenty trillion, thirteen billion, six hundred fifty-three million, seven hundred thirty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •