Base | Representation |
---|---|
bin | 100000001111010110001… |
… | …100010011010011001101 |
3 | 21211210121010022211000020 |
4 | 200033112030103103031 |
5 | 242244321414101240 |
6 | 4413442030252353 |
7 | 316031124533346 |
oct | 40172614232315 |
9 | 7753533284006 |
10 | 2215501706445 |
11 | 784652a56525 |
12 | 2b94670570b9 |
13 | 130bc83312c1 |
14 | 793336730cd |
15 | 3c96c31a0d0 |
hex | 203d63134cd |
2215501706445 has 16 divisors (see below), whose sum is σ = 3546467789760. Its totient is φ = 1181045890304.
The previous prime is 2215501706441. The next prime is 2215501706471. The reversal of 2215501706445 is 5446071055122.
It is a cyclic number.
It is not a de Polignac number, because 2215501706445 - 22 = 2215501706441 is a prime.
It is a super-2 number, since 2×22155017064452 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2215501706397 and 2215501706406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2215501706441) 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, 34655739 + ... + 34719608.
It is an arithmetic number, because the mean of its divisors is an integer number (221654236860).
Almost surely, 22215501706445 is an apocalyptic number.
It is an amenable number.
2215501706445 is a deficient number, since it is larger than the sum of its proper divisors (1330966083315).
2215501706445 is a wasteful number, since it uses less digits than its factorization.
2215501706445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69377484.
The product of its (nonzero) digits is 336000, while the sum is 42.
The spelling of 2215501706445 in words is "two trillion, two hundred fifteen billion, five hundred one million, seven hundred six thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •