Base | Representation |
---|---|
bin | 101000100111001… |
… | …100111000100111 |
3 | 1202111002221002220 |
4 | 220213030320213 |
5 | 2343412140111 |
6 | 151340003423 |
7 | 22612335654 |
oct | 5047147047 |
9 | 1674087086 |
10 | 681365031 |
11 | 31a6816a6 |
12 | 170230573 |
13 | ab216399 |
14 | 666c6c2b |
15 | 3ec40e06 |
hex | 289cce27 |
681365031 has 4 divisors (see below), whose sum is σ = 908486712. Its totient is φ = 454243352.
The previous prime is 681365029. The next prime is 681365051. The reversal of 681365031 is 130563186.
681365031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 681365031 - 21 = 681365029 is a prime.
It is a super-2 number, since 2×6813650312 = 928516610939261922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 681364983 and 681365001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (681365021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 113560836 + ... + 113560841.
It is an arithmetic number, because the mean of its divisors is an integer number (227121678).
Almost surely, 2681365031 is an apocalyptic number.
681365031 is a deficient number, since it is larger than the sum of its proper divisors (227121681).
681365031 is a wasteful number, since it uses less digits than its factorization.
681365031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227121680.
The product of its (nonzero) digits is 12960, while the sum is 33.
The square root of 681365031 is about 26102.9697735717. The cubic root of 681365031 is about 879.9539537718.
The spelling of 681365031 in words is "six hundred eighty-one million, three hundred sixty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •