Base | Representation |
---|---|
bin | 10011110101010110000… |
… | …11100001101011000001 |
3 | 2102011000010210200011101 |
4 | 21322223003201223001 |
5 | 42131130003123212 |
6 | 1241022023014401 |
7 | 100143402021001 |
oct | 11725303415301 |
9 | 2364003720141 |
10 | 681474661057 |
11 | 243014753323 |
12 | b00a859a401 |
13 | 4c355452018 |
14 | 24daac08001 |
15 | 12ad7a2d157 |
hex | 9eab0e1ac1 |
681474661057 has 8 divisors (see below), whose sum is σ = 682761420000. Its totient is φ = 680188052544.
The previous prime is 681474660991. The next prime is 681474661067. The reversal of 681474661057 is 750166474186.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 681474661057 - 27 = 681474660929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 681474660989 and 681474661007.
It is not an unprimeable number, because it can be changed into a prime (681474661067) 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 7 ways as a sum of consecutive naturals, for example, 13742694 + ... + 13792192.
It is an arithmetic number, because the mean of its divisors is an integer number (85345177500).
Almost surely, 2681474661057 is an apocalyptic number.
It is an amenable number.
681474661057 is a deficient number, since it is larger than the sum of its proper divisors (1286758943).
681474661057 is a wasteful number, since it uses less digits than its factorization.
681474661057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75215.
The product of its (nonzero) digits is 6773760, while the sum is 55.
The spelling of 681474661057 in words is "six hundred eighty-one billion, four hundred seventy-four million, six hundred sixty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •