Base | Representation |
---|---|
bin | 11100000011010100101011… |
… | …11000001010010000011001 |
3 | 22002102012111120201112101112 |
4 | 32001222111320022100121 |
5 | 31041134114204114114 |
6 | 335110312443030105 |
7 | 15664504162432253 |
oct | 1601522570122031 |
9 | 262365446645345 |
10 | 61686834832409 |
11 | 187232700aa3a6 |
12 | 6b033a420b335 |
13 | 2856074932667 |
14 | 1133931802cd3 |
15 | 71e9396e613e |
hex | 381a95e0a419 |
61686834832409 has 4 divisors (see below), whose sum is σ = 61701840147840. Its totient is φ = 61671829516980.
The previous prime is 61686834832387. The next prime is 61686834832457. The reversal of 61686834832409 is 90423843868616.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 61686834832409 - 28 = 61686834832153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61686834831409) 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 in 3 ways as a sum of consecutive naturals, for example, 7502651549 + ... + 7502659770.
It is an arithmetic number, because the mean of its divisors is an integer number (15425460036960).
Almost surely, 261686834832409 is an apocalyptic number.
It is an amenable number.
61686834832409 is a deficient number, since it is larger than the sum of its proper divisors (15005315431).
61686834832409 is a wasteful number, since it uses less digits than its factorization.
61686834832409 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15005315430.
The product of its (nonzero) digits is 286654464, while the sum is 68.
The spelling of 61686834832409 in words is "sixty-one trillion, six hundred eighty-six billion, eight hundred thirty-four million, eight hundred thirty-two thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •