Base | Representation |
---|---|
bin | 1001001001011110010011… |
… | …00010111011110110000101 |
3 | 2122020010202022222200022012 |
4 | 10210233021202323312011 |
5 | 10114043012041204410 |
6 | 110441253535344005 |
7 | 4144245623044433 |
oct | 444571142736605 |
9 | 78203668880265 |
10 | 20116713225605 |
11 | 64564a51a0987 |
12 | 230a906682005 |
13 | b2bcc8569889 |
14 | 4d7922c6bd53 |
15 | 24d4364ec605 |
hex | 124bc98bbd85 |
20116713225605 has 16 divisors (see below), whose sum is σ = 25411611859200. Its totient is φ = 15245735037120.
The previous prime is 20116713225601. The next prime is 20116713225607. The reversal of 20116713225605 is 50652231761102.
It is not a de Polignac number, because 20116713225605 - 22 = 20116713225601 is a prime.
It is a super-2 number, since 2×201167132256052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20116713225601) 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 15 ways as a sum of consecutive naturals, for example, 1907645 + ... + 6623634.
It is an arithmetic number, because the mean of its divisors is an integer number (1588225741200).
Almost surely, 220116713225605 is an apocalyptic number.
It is an amenable number.
20116713225605 is a deficient number, since it is larger than the sum of its proper divisors (5294898633595).
20116713225605 is a wasteful number, since it uses less digits than its factorization.
20116713225605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8556124.
The product of its (nonzero) digits is 151200, while the sum is 41.
Adding to 20116713225605 its reverse (50652231761102), we get a palindrome (70768944986707).
The spelling of 20116713225605 in words is "twenty trillion, one hundred sixteen billion, seven hundred thirteen million, two hundred twenty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •