Base | Representation |
---|---|
bin | 100110101111001101001… |
… | …100110010100100111101 |
3 | 100102111011021021020211112 |
4 | 212233031030302210331 |
5 | 322103313011012042 |
6 | 5354530222331405 |
7 | 363216343611635 |
oct | 46571514624475 |
9 | 10374137236745 |
10 | 2662027438397 |
11 | 936a610a9968 |
12 | 36bb03729b65 |
13 | 1640499b2142 |
14 | 92bb29856c5 |
15 | 493a3580982 |
hex | 26bcd33293d |
2662027438397 has 2 divisors, whose sum is σ = 2662027438398. Its totient is φ = 2662027438396.
The previous prime is 2662027438391. The next prime is 2662027438403. The reversal of 2662027438397 is 7938347202662.
It is a balanced prime because it is at equal distance from previous prime (2662027438391) and next prime (2662027438403).
It can be written as a sum of positive squares in only one way, i.e., 2171774005636 + 490253432761 = 1473694^2 + 700181^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2662027438397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2662027438391) 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 as a sum of consecutive naturals, namely, 1331013719198 + 1331013719199.
It is an arithmetic number, because the mean of its divisors is an integer number (1331013719199).
Almost surely, 22662027438397 is an apocalyptic number.
It is an amenable number.
2662027438397 is a deficient number, since it is larger than the sum of its proper divisors (1).
2662027438397 is an equidigital number, since it uses as much as digits as its factorization.
2662027438397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36578304, while the sum is 59.
The spelling of 2662027438397 in words is "two trillion, six hundred sixty-two billion, twenty-seven million, four hundred thirty-eight thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •