Base | Representation |
---|---|
bin | 1001001000010100101110… |
… | …10101101111011101010100 |
3 | 2122002100210201100220200201 |
4 | 10210022113111233131110 |
5 | 10112421114321404112 |
6 | 110411202405150244 |
7 | 4141350063631021 |
oct | 444122725573524 |
9 | 78070721326621 |
10 | 20077216200532 |
11 | 64407771513a7 |
12 | 23031230bb384 |
13 | b2837277151a |
14 | 4d5a573cc548 |
15 | 24c3c3c6a257 |
hex | 12429756f754 |
20077216200532 has 12 divisors (see below), whose sum is σ = 35711114062036. Its totient is φ = 9874040754240.
The previous prime is 20077216200527. The next prime is 20077216200541. The reversal of 20077216200532 is 23500261277002.
It can be written as a sum of positive squares in 2 ways, for example, as 502644132676 + 19574572067856 = 708974^2 + 4424316^2 .
It is a super-2 number, since 2×200772162005322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20077216200491 and 20077216200500.
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 3 ways as a sum of consecutive naturals, for example, 41141836233 + ... + 41141836720.
Almost surely, 220077216200532 is an apocalyptic number.
It is an amenable number.
20077216200532 is a deficient number, since it is larger than the sum of its proper divisors (15633897861504).
20077216200532 is a wasteful number, since it uses less digits than its factorization.
20077216200532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82283673018 (or 82283673016 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 37.
Adding to 20077216200532 its reverse (23500261277002), we get a palindrome (43577477477534).
The spelling of 20077216200532 in words is "twenty trillion, seventy-seven billion, two hundred sixteen million, two hundred thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.067 sec. • engine limits •