Base | Representation |
---|---|
bin | 100000001111011111110… |
… | …010011100001110001001 |
3 | 21211211000100021002211022 |
4 | 200033133302130032021 |
5 | 242300134122340101 |
6 | 4413510021042225 |
7 | 316035121126514 |
oct | 40173762341611 |
9 | 7754010232738 |
10 | 2215662699401 |
11 | 784725916958 |
12 | 2b94b0b56375 |
13 | 130c227ab9c8 |
14 | 7934abbdd7b |
15 | 3c97b51ba1b |
hex | 203dfc9c389 |
2215662699401 has 2 divisors, whose sum is σ = 2215662699402. Its totient is φ = 2215662699400.
The previous prime is 2215662699373. The next prime is 2215662699407. The reversal of 2215662699401 is 1049962665122.
2215662699401 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1563850291600 + 651812407801 = 1250540^2 + 807349^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2215662699401 is a prime.
It is a super-2 number, since 2×22156626994012 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2215662699407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1107831349700 + 1107831349701.
It is an arithmetic number, because the mean of its divisors is an integer number (1107831349701).
Almost surely, 22215662699401 is an apocalyptic number.
It is an amenable number.
2215662699401 is a deficient number, since it is larger than the sum of its proper divisors (1).
2215662699401 is an equidigital number, since it uses as much as digits as its factorization.
2215662699401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2799360, while the sum is 53.
The spelling of 2215662699401 in words is "two trillion, two hundred fifteen billion, six hundred sixty-two million, six hundred ninety-nine thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •