Base | Representation |
---|---|
bin | 110000010010011… |
… | …100101111011001 |
3 | 2002110102111211111 |
4 | 300102130233121 |
5 | 3124344031211 |
6 | 212220100321 |
7 | 26035046005 |
oct | 6022345731 |
9 | 2073374744 |
10 | 810142681 |
11 | 386339207 |
12 | 1a73946a1 |
13 | cbac468a |
14 | 79849705 |
15 | 4b1cc421 |
hex | 3049cbd9 |
810142681 has 8 divisors (see below), whose sum is σ = 813608640. Its totient is φ = 806684592.
The previous prime is 810142679. The next prime is 810142687. The reversal of 810142681 is 186241018.
810142681 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 810142681 - 21 = 810142679 is a prime.
It is a super-2 number, since 2×8101426812 = 1312662327155735522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (810142687) 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, 287626 + ... + 290428.
It is an arithmetic number, because the mean of its divisors is an integer number (101701080).
Almost surely, 2810142681 is an apocalyptic number.
It is an amenable number.
810142681 is a deficient number, since it is larger than the sum of its proper divisors (3465959).
810142681 is a wasteful number, since it uses less digits than its factorization.
810142681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3935.
The product of its (nonzero) digits is 3072, while the sum is 31.
The square root of 810142681 is about 28463.0054807991. The cubic root of 810142681 is about 932.2244822815.
Adding to 810142681 its reverse (186241018), we get a palindrome (996383699).
The spelling of 810142681 in words is "eight hundred ten million, one hundred forty-two thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •