Base | Representation |
---|---|
bin | 1001000110001010111001… |
… | …11000100100110001111100 |
3 | 2121211021210212101212222110 |
4 | 10203011130320210301330 |
5 | 10110213044041011220 |
6 | 110313204120014020 |
7 | 4133120315236620 |
oct | 443053470446174 |
9 | 77737725355873 |
10 | 20003221032060 |
11 | 6412355876102 |
12 | 22b0912301310 |
13 | b213ac707676 |
14 | 4d2237d5d180 |
15 | 24a4e2a3abe0 |
hex | 12315ce24c7c |
20003221032060 has 96 divisors (see below), whose sum is σ = 64020042680832. Its totient is φ = 4571469423360.
The previous prime is 20003221032029. The next prime is 20003221032061. The reversal of 20003221032060 is 6023012230002.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20003221032061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 854482 + ... + 6382521.
It is an arithmetic number, because the mean of its divisors is an integer number (666875444592).
Almost surely, 220003221032060 is an apocalyptic number.
20003221032060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20003221032060 is an abundant number, since it is smaller than the sum of its proper divisors (44016821648772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20003221032060 is a wasteful number, since it uses less digits than its factorization.
20003221032060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7243603 (or 7243601 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 20003221032060 its reverse (6023012230002), we get a palindrome (26026233262062).
The spelling of 20003221032060 in words is "twenty trillion, three billion, two hundred twenty-one million, thirty-two thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •