Base | Representation |
---|---|
bin | 10010110100001100… |
… | …110000011001010000 |
3 | 1221010222201102120000 |
4 | 102310030300121100 |
5 | 312333444041031 |
6 | 13140422450000 |
7 | 1313436422133 |
oct | 226414603120 |
9 | 57128642500 |
10 | 20203112016 |
11 | 862814809a |
12 | 3ab9b93900 |
13 | 1b9c7b1569 |
14 | d9927821a |
15 | 7d39dc3e6 |
hex | 4b4330650 |
20203112016 has 50 divisors (see below), whose sum is σ = 58473671322. Its totient is φ = 6734370240.
The previous prime is 20203112011. The next prime is 20203112023. The reversal of 20203112016 is 61021130202.
It can be written as a sum of positive squares in only one way, i.e., 17608228416 + 2594883600 = 132696^2 + 50940^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a self number, because there is not a number n which added to its sum of digits gives 20203112016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20203112011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 7793115 + ... + 7795706.
Almost surely, 220203112016 is an apocalyptic number.
It is an amenable number.
20203112016 is an abundant number, since it is smaller than the sum of its proper divisors (38270559306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20203112016 is a wasteful number, since it uses less digits than its factorization.
20203112016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15588841 (or 15588826 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 20203112016 its reverse (61021130202), we get a palindrome (81224242218).
The spelling of 20203112016 in words is "twenty billion, two hundred three million, one hundred twelve thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •