Base | Representation |
---|---|
bin | 11100001001001011111010… |
… | …01100000011101010101110 |
3 | 22010010110110221000122221210 |
4 | 32010211331030003222232 |
5 | 31102434201211041224 |
6 | 335343030223335250 |
7 | 16015165241666262 |
oct | 1604457514035256 |
9 | 263113427018853 |
10 | 61888284080814 |
11 | 187a0745a37354 |
12 | 6b36445151526 |
13 | 286c06a284569 |
14 | 113d5a21760a2 |
15 | 724cc9edc429 |
hex | 38497d303aae |
61888284080814 has 8 divisors (see below), whose sum is σ = 123776568161640. Its totient is φ = 20629428026936.
The previous prime is 61888284080761. The next prime is 61888284080837. The reversal of 61888284080814 is 41808048288816.
61888284080814 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
61888284080814 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5157357006729 + ... + 5157357006740.
It is an arithmetic number, because the mean of its divisors is an integer number (15472071020205).
Almost surely, 261888284080814 is an apocalyptic number.
61888284080814 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61888284080814 is a wasteful number, since it uses less digits than its factorization.
61888284080814 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10314714013474.
The product of its (nonzero) digits is 50331648, while the sum is 66.
The spelling of 61888284080814 in words is "sixty-one trillion, eight hundred eighty-eight billion, two hundred eighty-four million, eighty thousand, eight hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •