Base | Representation |
---|---|
bin | 110001111100100111111000… |
… | …001000010100110111100001 |
3 | 1001210210021100111001120020112 |
4 | 301330213320020110313201 |
5 | 212243034200403123423 |
6 | 2055111043212221105 |
7 | 64161436645454105 |
oct | 6174477010246741 |
9 | 1053707314046215 |
10 | 219670265286113 |
11 | 63aa26aaa64484 |
12 | 2077969b46a795 |
13 | 9575a81314255 |
14 | 3c36151a2d905 |
15 | 1a5e1db090a78 |
hex | c7c9f8214de1 |
219670265286113 has 2 divisors, whose sum is σ = 219670265286114. Its totient is φ = 219670265286112.
The previous prime is 219670265286097. The next prime is 219670265286127. The reversal of 219670265286113 is 311682562076912.
219670265286113 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., 198414043746304 + 21256221539809 = 14085952^2 + 4610447^2 .
It is a cyclic number.
It is not a de Polignac number, because 219670265286113 - 24 = 219670265286097 is a prime.
It is not a weakly prime, because it can be changed into another prime (219670265286013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 109835132643056 + 109835132643057.
It is an arithmetic number, because the mean of its divisors is an integer number (109835132643057).
Almost surely, 2219670265286113 is an apocalyptic number.
It is an amenable number.
219670265286113 is a deficient number, since it is larger than the sum of its proper divisors (1).
219670265286113 is an equidigital number, since it uses as much as digits as its factorization.
219670265286113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13063680, while the sum is 59.
The spelling of 219670265286113 in words is "two hundred nineteen trillion, six hundred seventy billion, two hundred sixty-five million, two hundred eighty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •