Base | Representation |
---|---|
bin | 1100101110011010… |
… | …10000000000001011 |
3 | 122122010020102012220 |
4 | 12113031100000023 |
5 | 102442420102311 |
6 | 3045525105123 |
7 | 331204226136 |
oct | 62715200013 |
9 | 18563212186 |
10 | 6831800331 |
11 | 2996411784 |
12 | 13a7b581a3 |
13 | 84b504205 |
14 | 48b49521d |
15 | 29eb92206 |
hex | 19735000b |
6831800331 has 8 divisors (see below), whose sum is σ = 9505113600. Its totient is φ = 4356510312.
The previous prime is 6831800321. The next prime is 6831800363. The reversal of 6831800331 is 1330081386.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6831800331 - 25 = 6831800299 is a prime.
It is a super-2 number, since 2×68318003312 = 93346991525303419122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6831800292 and 6831800301.
It is not an unprimeable number, because it can be changed into a prime (6831800321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49505731 + ... + 49505868.
It is an arithmetic number, because the mean of its divisors is an integer number (1188139200).
Almost surely, 26831800331 is an apocalyptic number.
6831800331 is a deficient number, since it is larger than the sum of its proper divisors (2673313269).
6831800331 is a wasteful number, since it uses less digits than its factorization.
6831800331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99011625.
The product of its (nonzero) digits is 10368, while the sum is 33.
The square root of 6831800331 is about 82654.7054377426. The cubic root of 6831800331 is about 1897.4851613803.
The spelling of 6831800331 in words is "six billion, eight hundred thirty-one million, eight hundred thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •