Base | Representation |
---|---|
bin | 1000010000000111… |
… | …1101011000011001 |
3 | 12201101010001021200 |
4 | 2010001331120121 |
5 | 14014031343243 |
6 | 1003445224413 |
7 | 105615043125 |
oct | 20401753031 |
9 | 5641101250 |
10 | 2215106073 |
11 | a37407a84 |
12 | 519a02109 |
13 | 293bc036b |
14 | 170290585 |
15 | ce702ad3 |
hex | 8407d619 |
2215106073 has 6 divisors (see below), whose sum is σ = 3199597674. Its totient is φ = 1476737376.
The previous prime is 2215106071. The next prime is 2215106083. The reversal of 2215106073 is 3706015122.
It is a happy number.
2215106073 is a `hidden beast` number, since 2 + 2 + 1 + 51 + 0 + 607 + 3 = 666.
It can be written as a sum of positive squares in only one way, i.e., 2023920144 + 191185929 = 44988^2 + 13827^2 .
It is not a de Polignac number, because 2215106073 - 21 = 2215106071 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2215106071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 123061440 + ... + 123061457.
It is an arithmetic number, because the mean of its divisors is an integer number (533266279).
Almost surely, 22215106073 is an apocalyptic number.
It is an amenable number.
2215106073 is a deficient number, since it is larger than the sum of its proper divisors (984491601).
2215106073 is a wasteful number, since it uses less digits than its factorization.
2215106073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246122903 (or 246122900 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 2215106073 is about 47064.9133962870. The cubic root of 2215106073 is about 1303.5614517684.
The spelling of 2215106073 in words is "two billion, two hundred fifteen million, one hundred six thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •