Base | Representation |
---|---|
bin | 1001001001011101100100… |
… | …01001010010101010100101 |
3 | 2122020002201222020121202122 |
4 | 10210232302021102222211 |
5 | 10114041211040033430 |
6 | 110441150552515325 |
7 | 4144233115031234 |
oct | 444566211225245 |
9 | 78202658217678 |
10 | 20116320627365 |
11 | 6456313621026 |
12 | 230a8170abb45 |
13 | b2bc6511a321 |
14 | 4d78c6a72b1b |
15 | 24d411cebee5 |
hex | 124bb2252aa5 |
20116320627365 has 4 divisors (see below), whose sum is σ = 24139584752844. Its totient is φ = 16093056501888.
The previous prime is 20116320627349. The next prime is 20116320627371. The reversal of 20116320627365 is 56372602361102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8955122085121 + 11161198542244 = 2992511^2 + 3340838^2 .
It is a cyclic number.
It is not a de Polignac number, because 20116320627365 - 24 = 20116320627349 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2011632062732 + ... + 2011632062741.
It is an arithmetic number, because the mean of its divisors is an integer number (6034896188211).
Almost surely, 220116320627365 is an apocalyptic number.
It is an amenable number.
20116320627365 is a deficient number, since it is larger than the sum of its proper divisors (4023264125479).
20116320627365 is an equidigital number, since it uses as much as digits as its factorization.
20116320627365 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4023264125478.
The product of its (nonzero) digits is 544320, while the sum is 44.
Adding to 20116320627365 its reverse (56372602361102), we get a palindrome (76488922988467).
The spelling of 20116320627365 in words is "twenty trillion, one hundred sixteen billion, three hundred twenty million, six hundred twenty-seven thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •