Base | Representation |
---|---|
bin | 111000110111111001… |
… | …001000001010011101 |
3 | 12211121212211110122022 |
4 | 320313321020022131 |
5 | 2000031204432134 |
6 | 44015351225525 |
7 | 4261206120335 |
oct | 706771101235 |
9 | 184555743568 |
10 | 61067264669 |
11 | 23997973884 |
12 | ba033782a5 |
13 | 59b28b8b48 |
14 | 2d545100c5 |
15 | 18c62be52e |
hex | e37e4829d |
61067264669 has 2 divisors, whose sum is σ = 61067264670. Its totient is φ = 61067264668.
The previous prime is 61067264651. The next prime is 61067264677. The reversal of 61067264669 is 96646276016.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60805148569 + 262116100 = 246587^2 + 16190^2 .
It is a cyclic number.
It is not a de Polignac number, because 61067264669 - 216 = 61067199133 is a prime.
It is a super-2 number, since 2×610672646692 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 61067264669.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (61067264689) 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, 30533632334 + 30533632335.
It is an arithmetic number, because the mean of its divisors is an integer number (30533632335).
Almost surely, 261067264669 is an apocalyptic number.
It is an amenable number.
61067264669 is a deficient number, since it is larger than the sum of its proper divisors (1).
61067264669 is an equidigital number, since it uses as much as digits as its factorization.
61067264669 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3919104, while the sum is 53.
The spelling of 61067264669 in words is "sixty-one billion, sixty-seven million, two hundred sixty-four thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •