Base | Representation |
---|---|
bin | 1001010000101001111110… |
… | …10111011100100011010100 |
3 | 2200002201202112121021201122 |
4 | 10220110333113130203110 |
5 | 10132113423240424304 |
6 | 111150510354143112 |
7 | 4201133406041342 |
oct | 450247727344324 |
9 | 80081675537648 |
10 | 20363503061204 |
11 | 654112766a0a6 |
12 | 234a6bbb81a98 |
13 | b4936853b5b4 |
14 | 5058551aa992 |
15 | 254a7c5ab9be |
hex | 12853f5dc8d4 |
20363503061204 has 12 divisors (see below), whose sum is σ = 35644235034324. Its totient is φ = 10179435908544.
The previous prime is 20363503061189. The next prime is 20363503061207. The reversal of 20363503061204 is 40216030536302.
It can be written as a sum of positive squares in 2 ways, for example, as 9592635451204 + 10770867610000 = 3097198^2 + 3281900^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20363503061207) by changing a digit.
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, 578885729 + ... + 578920904.
It is an arithmetic number, because the mean of its divisors is an integer number (2970352919527).
Almost surely, 220363503061204 is an apocalyptic number.
It is an amenable number.
20363503061204 is a deficient number, since it is larger than the sum of its proper divisors (15280731973120).
20363503061204 is a wasteful number, since it uses less digits than its factorization.
20363503061204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1157811034 (or 1157811032 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 35.
Adding to 20363503061204 its reverse (40216030536302), we get a palindrome (60579533597506).
The spelling of 20363503061204 in words is "twenty trillion, three hundred sixty-three billion, five hundred three million, sixty-one thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •