Base | Representation |
---|---|
bin | 1001001101111101100011… |
… | …01101001001000001010011 |
3 | 2122202212211002221201100202 |
4 | 10212332301231021001103 |
5 | 10124104332102223413 |
6 | 111040200532405415 |
7 | 4161345410435123 |
oct | 446766155110123 |
9 | 78685732851322 |
10 | 20270932070483 |
11 | 6505943767696 |
12 | 233478617686b |
13 | b40704b92443 |
14 | 501192a5cc83 |
15 | 25246067ee58 |
hex | 126fb1b49053 |
20270932070483 has 4 divisors (see below), whose sum is σ = 20479910751720. Its totient is φ = 20061953389248.
The previous prime is 20270932070453. The next prime is 20270932070527. The reversal of 20270932070483 is 38407023907202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20270932070483 - 210 = 20270932069459 is a prime.
It is a super-2 number, since 2×202709320704832 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20270932070453) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 104489340473 + ... + 104489340666.
It is an arithmetic number, because the mean of its divisors is an integer number (5119977687930).
Almost surely, 220270932070483 is an apocalyptic number.
20270932070483 is a deficient number, since it is larger than the sum of its proper divisors (208978681237).
20270932070483 is an equidigital number, since it uses as much as digits as its factorization.
20270932070483 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 208978681236.
The product of its (nonzero) digits is 1016064, while the sum is 47.
Adding to 20270932070483 its reverse (38407023907202), we get a palindrome (58677955977685).
The spelling of 20270932070483 in words is "twenty trillion, two hundred seventy billion, nine hundred thirty-two million, seventy thousand, four hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •