Base | Representation |
---|---|
bin | 1001011100011111010000… |
… | …10010011101101001011100 |
3 | 2201112121011110210102022212 |
4 | 10232033220102131221130 |
5 | 10210244042342432200 |
6 | 112101345150455552 |
7 | 4242405356206214 |
oct | 456175022355134 |
9 | 81477143712285 |
10 | 20770064030300 |
11 | 6688597741702 |
12 | 23b54645045b8 |
13 | b787bb226870 |
14 | 51b3c2885244 |
15 | 260424e9b035 |
hex | 12e3e849da5c |
20770064030300 has 288 divisors, whose sum is σ = 50361161262720. Its totient is φ = 7385532825600.
The previous prime is 20770064030279. The next prime is 20770064030323. The reversal of 20770064030300 is 303046007702.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1935875336 + ... + 1935886064.
Almost surely, 220770064030300 is an apocalyptic number.
20770064030300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20770064030300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25180580631360).
20770064030300 is an abundant number, since it is smaller than the sum of its proper divisors (29591097232420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20770064030300 is a wasteful number, since it uses less digits than its factorization.
20770064030300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11201 (or 11194 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 32.
The spelling of 20770064030300 in words is "twenty trillion, seven hundred seventy billion, sixty-four million, thirty thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •