Base | Representation |
---|---|
bin | 1001001001110000000101… |
… | …01011101001001110000000 |
3 | 2122021001101210012200210121 |
4 | 10210320002223221032000 |
5 | 10114222041001311022 |
6 | 110445513233310024 |
7 | 4145034346111120 |
oct | 444700253511600 |
9 | 78231353180717 |
10 | 20126261744512 |
11 | 645a555078520 |
12 | 2310730405314 |
13 | b2cb8a85c171 |
14 | 4d818b068c80 |
15 | 24d7e49282c7 |
hex | 124e02ae9380 |
20126261744512 has 128 divisors (see below), whose sum is σ = 50735034420480. Its totient is φ = 7724364595200.
The previous prime is 20126261744473. The next prime is 20126261744569. The reversal of 20126261744512 is 21544716262102.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14578689 + ... + 15899392.
It is an arithmetic number, because the mean of its divisors is an integer number (396367456410).
Almost surely, 220126261744512 is an apocalyptic number.
20126261744512 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
20126261744512 is an abundant number, since it is smaller than the sum of its proper divisors (30608772675968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20126261744512 is a wasteful number, since it uses less digits than its factorization.
20126261744512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30478180 (or 30478168 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 43.
The spelling of 20126261744512 in words is "twenty trillion, one hundred twenty-six billion, two hundred sixty-one million, seven hundred forty-four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •