Base | Representation |
---|---|
bin | 10111100100111000110… |
… | …00010011101000011101 |
3 | 2212102221200200012220010 |
4 | 23302130120103220131 |
5 | 101233014313003323 |
6 | 1420051111313433 |
7 | 112345321606515 |
oct | 13623430235035 |
9 | 2772850605803 |
10 | 810077469213 |
11 | 292608681551 |
12 | 110bb937b879 |
13 | 5b50ba1c2cc |
14 | 2b2ca8d2845 |
15 | 16112da3c93 |
hex | bc9c613a1d |
810077469213 has 8 divisors (see below), whose sum is σ = 1127064305088. Its totient is φ = 516571139744.
The previous prime is 810077469211. The next prime is 810077469217. The reversal of 810077469213 is 312964770018.
It is a happy number.
810077469213 is digitally balanced in base 2 and base 4, because in such bases 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 810077469213 - 21 = 810077469211 is a prime.
It is a super-2 number, since 2×8100774692132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (810077469211) 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, 5870126520 + ... + 5870126657.
It is an arithmetic number, because the mean of its divisors is an integer number (140883038136).
Almost surely, 2810077469213 is an apocalyptic number.
It is an amenable number.
810077469213 is a deficient number, since it is larger than the sum of its proper divisors (316986835875).
810077469213 is a wasteful number, since it uses less digits than its factorization.
810077469213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11740253203.
The product of its (nonzero) digits is 508032, while the sum is 48.
The spelling of 810077469213 in words is "eight hundred ten billion, seventy-seven million, four hundred sixty-nine thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •