Base | Representation |
---|---|
bin | 1001000111100111110101… |
… | …10001011011110001111101 |
3 | 2122000001121000221210001101 |
4 | 10203303322301123301331 |
5 | 10112022234314204243 |
6 | 110352135040213101 |
7 | 4136534605462525 |
oct | 443637261336175 |
9 | 78001530853041 |
10 | 20053114600573 |
11 | 643152945464a |
12 | 22ba51760a191 |
13 | b260013c1382 |
14 | 4d480c4a6685 |
15 | 24b962daa54d |
hex | 123cfac5bc7d |
20053114600573 has 24 divisors (see below), whose sum is σ = 21677207555808. Its totient is φ = 18538442606112.
The previous prime is 20053114600567. The next prime is 20053114600591. The reversal of 20053114600573 is 37500641135002.
It is a de Polignac number, because none of the positive numbers 2k-20053114600573 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20053114600513) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3459115 + ... + 7216072.
It is an arithmetic number, because the mean of its divisors is an integer number (903216981492).
Almost surely, 220053114600573 is an apocalyptic number.
20053114600573 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
20053114600573 is a deficient number, since it is larger than the sum of its proper divisors (1624092955235).
20053114600573 is a wasteful number, since it uses less digits than its factorization.
20053114600573 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10675353 (or 10675330 counting only the distinct ones).
The product of its (nonzero) digits is 75600, while the sum is 37.
Adding to 20053114600573 its reverse (37500641135002), we get a palindrome (57553755735575).
The spelling of 20053114600573 in words is "twenty trillion, fifty-three billion, one hundred fourteen million, six hundred thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •