Base | Representation |
---|---|
bin | 1001001001011000001000… |
… | …10111001111110010011111 |
3 | 2122012211012210001221112100 |
4 | 10210230010113033302133 |
5 | 10114014223143100030 |
6 | 110435545401540143 |
7 | 4144100633031564 |
oct | 444540427176237 |
9 | 78184183057470 |
10 | 20113405050015 |
11 | 6455057882672 |
12 | 230a1427a4653 |
13 | b2b8bc084224 |
14 | 4d76cb76486b |
15 | 24d2e0d82360 |
hex | 124b045cfc9f |
20113405050015 has 24 divisors (see below), whose sum is σ = 35183081625120. Its totient is φ = 10628735143104.
The previous prime is 20113405049999. The next prime is 20113405050019. The reversal of 20113405050015 is 51005050431102.
20113405050015 is a `hidden beast` number, since 2 + 0 + 113 + 40 + 5 + 0 + 500 + 1 + 5 = 666.
It is not a de Polignac number, because 20113405050015 - 24 = 20113405049999 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20113405050019) 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 23 ways as a sum of consecutive naturals, for example, 2050291227 + ... + 2050301036.
It is an arithmetic number, because the mean of its divisors is an integer number (1465961734380).
Almost surely, 220113405050015 is an apocalyptic number.
20113405050015 is a deficient number, since it is larger than the sum of its proper divisors (15069676575105).
20113405050015 is a wasteful number, since it uses less digits than its factorization.
20113405050015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4100592383 (or 4100592380 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
Adding to 20113405050015 its reverse (51005050431102), we get a palindrome (71118455481117).
The spelling of 20113405050015 in words is "twenty trillion, one hundred thirteen billion, four hundred five million, fifty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •