Base | Representation |
---|---|
bin | 11110101001011001100… |
… | …011000000100001011101 |
3 | 21110100001021220020122211 |
4 | 132221121203000201131 |
5 | 234001130244340240 |
6 | 4251255535240421 |
7 | 305104354251064 |
oct | 36513143004135 |
9 | 7410037806584 |
10 | 2106036324445 |
11 | 74218a667879 |
12 | 2a01b7379111 |
13 | 1237a181a411 |
14 | 73d0b4971db |
15 | 39bb2127bea |
hex | 1ea598c085d |
2106036324445 has 16 divisors (see below), whose sum is σ = 2664310602240. Its totient is φ = 1594961432064.
The previous prime is 2106036324443. The next prime is 2106036324451. The reversal of 2106036324445 is 5444236306012.
It is a cyclic number.
It is not a de Polignac number, because 2106036324445 - 21 = 2106036324443 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2106036324398 and 2106036324407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2106036324443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94387605 + ... + 94409914.
It is an arithmetic number, because the mean of its divisors is an integer number (166519412640).
Almost surely, 22106036324445 is an apocalyptic number.
It is an amenable number.
2106036324445 is a deficient number, since it is larger than the sum of its proper divisors (558274277795).
2106036324445 is a wasteful number, since it uses less digits than its factorization.
2106036324445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188797644.
The product of its (nonzero) digits is 414720, while the sum is 40.
It can be divided in two parts, 2106036 and 324445, that added together give a square (2430481 = 15592).
The spelling of 2106036324445 in words is "two trillion, one hundred six billion, thirty-six million, three hundred twenty-four thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •