Base | Representation |
---|---|
bin | 1001101001101111110011011… |
… | …0111011000110111111001101 |
3 | 10022001220210101001222211110111 |
4 | 2122123330312323012333031 |
5 | 1203011314411221243414 |
6 | 10404325155203240021 |
7 | 263032010106463042 |
oct | 23233746673067715 |
9 | 3261823331884414 |
10 | 679219934556109 |
11 | 187469613914451 |
12 | 64219459979011 |
13 | 231cc21b6652bb |
14 | bda25c51c91c9 |
15 | 537d1089548c4 |
hex | 269bf36ec6fcd |
679219934556109 has 2 divisors, whose sum is σ = 679219934556110. Its totient is φ = 679219934556108.
The previous prime is 679219934556103. The next prime is 679219934556127. The reversal of 679219934556109 is 901655439912976.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 678608856214884 + 611078341225 = 26050122^2 + 781715^2 .
It is a cyclic number.
It is not a de Polignac number, because 679219934556109 - 23 = 679219934556101 is a prime.
It is a super-2 number, since 2×6792199345561092 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (679219934556101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 339609967278054 + 339609967278055.
It is an arithmetic number, because the mean of its divisors is an integer number (339609967278055).
Almost surely, 2679219934556109 is an apocalyptic number.
It is an amenable number.
679219934556109 is a deficient number, since it is larger than the sum of its proper divisors (1).
679219934556109 is an equidigital number, since it uses as much as digits as its factorization.
679219934556109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 992023200, while the sum is 76.
The spelling of 679219934556109 in words is "six hundred seventy-nine trillion, two hundred nineteen billion, nine hundred thirty-four million, five hundred fifty-six thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •