Base | Representation |
---|---|
bin | 1001011011101101011010… |
… | …11111001000111111010000 |
3 | 2201110001002210000201002112 |
4 | 10231312231133020333100 |
5 | 10204324243232202112 |
6 | 112041202145404452 |
7 | 4240440334125020 |
oct | 455665537107720 |
9 | 81401083021075 |
10 | 20743307694032 |
11 | 6678207464200 |
12 | 23b0237939728 |
13 | b76115b7a621 |
14 | 519da514da80 |
15 | 25e8aaee7a22 |
hex | 12ddad7c8fd0 |
20743307694032 has 480 divisors, whose sum is σ = 56750634393600. Its totient is φ = 7153888896000.
The previous prime is 20743307694017. The next prime is 20743307694077. The reversal of 20743307694032 is 23049670334702.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 231436907 + ... + 231526517.
It is an arithmetic number, because the mean of its divisors is an integer number (118230488320).
Almost surely, 220743307694032 is an apocalyptic number.
20743307694032 is a gapful number since it is divisible by the number (22) 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 20743307694032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28375317196800).
20743307694032 is an abundant number, since it is smaller than the sum of its proper divisors (36007326699568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20743307694032 is a wasteful number, since it uses less digits than its factorization.
20743307694032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89727 (or 89710 counting only the distinct ones).
The product of its (nonzero) digits is 4572288, while the sum is 50.
The spelling of 20743307694032 in words is "twenty trillion, seven hundred forty-three billion, three hundred seven million, six hundred ninety-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •