Base | Representation |
---|---|
bin | 101000100111100… |
… | …101011001001011 |
3 | 1202111022000210222 |
4 | 220213211121023 |
5 | 2343423343134 |
6 | 151342100255 |
7 | 22613234435 |
oct | 5047453113 |
9 | 1674260728 |
10 | 681465419 |
11 | 31a740068 |
12 | 17027a68b |
13 | ab24cc9b |
14 | 66711655 |
15 | 3ec60a2e |
hex | 289e564b |
681465419 has 8 divisors (see below), whose sum is σ = 734015040. Its totient is φ = 630584136.
The previous prime is 681465409. The next prime is 681465443. The reversal of 681465419 is 914564186.
681465419 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.
It is a cyclic number.
It is not a de Polignac number, because 681465419 - 212 = 681461323 is a prime.
It is a super-2 number, since 2×6814654192 = 928790234585691122, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 681465419.
It is not an unprimeable number, because it can be changed into a prime (681465409) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 416237 + ... + 417870.
It is an arithmetic number, because the mean of its divisors is an integer number (91751880).
Almost surely, 2681465419 is an apocalyptic number.
681465419 is a deficient number, since it is larger than the sum of its proper divisors (52549621).
681465419 is a wasteful number, since it uses less digits than its factorization.
681465419 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 834169.
The product of its digits is 207360, while the sum is 44.
The square root of 681465419 is about 26104.8926257129. The cubic root of 681465419 is about 879.9971672602.
The spelling of 681465419 in words is "six hundred eighty-one million, four hundred sixty-five thousand, four hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •