Base | Representation |
---|---|
bin | 100001000001100100011… |
… | …011011111010100100101 |
3 | 22000221210022112002112212 |
4 | 201001210123133110211 |
5 | 244140241440110234 |
6 | 4454321034453205 |
7 | 322650350554133 |
oct | 41014433372445 |
9 | 8027708462485 |
10 | 2269427660069 |
11 | 7a5505828649 |
12 | 3079b6894205 |
13 | 1360105681bb |
14 | 7bbab560753 |
15 | 3e0766aa5ce |
hex | 210646df525 |
2269427660069 has 2 divisors, whose sum is σ = 2269427660070. Its totient is φ = 2269427660068.
The previous prime is 2269427660051. The next prime is 2269427660167. The reversal of 2269427660069 is 9600667249622.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1765417116100 + 504010543969 = 1328690^2 + 709937^2 .
It is a cyclic number.
It is not a de Polignac number, because 2269427660069 - 224 = 2269410882853 is a prime.
It is a super-2 number, since 2×22694276600692 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2269427665069) 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 as a sum of consecutive naturals, namely, 1134713830034 + 1134713830035.
It is an arithmetic number, because the mean of its divisors is an integer number (1134713830035).
Almost surely, 22269427660069 is an apocalyptic number.
It is an amenable number.
2269427660069 is a deficient number, since it is larger than the sum of its proper divisors (1).
2269427660069 is an equidigital number, since it uses as much as digits as its factorization.
2269427660069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23514624, while the sum is 59.
The spelling of 2269427660069 in words is "two trillion, two hundred sixty-nine billion, four hundred twenty-seven million, six hundred sixty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •