Base | Representation |
---|---|
bin | 1011110001011011000100000… |
… | …1001101001101100010001001 |
3 | 11000122002222222121212000112212 |
4 | 2330112301001031031202021 |
5 | 1332034424434234300031 |
6 | 12053504231154514505 |
7 | 336326503006421360 |
oct | 27426610115154211 |
9 | 4018088877760485 |
10 | 828397206165641 |
11 | 21aa53311678842 |
12 | 78ab0b18295a35 |
13 | 297306a1532c98 |
14 | 1087c8d28947d7 |
15 | 65b87a453412b |
hex | 2f16c4134d889 |
828397206165641 has 8 divisors (see below), whose sum is σ = 946739846121984. Its totient is φ = 710054611692480.
The previous prime is 828397206165631. The next prime is 828397206165673. The reversal of 828397206165641 is 146561602793828.
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 828397206165641 - 226 = 828397139056777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (828397206165631) 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, 49089281 + ... + 63769521.
It is an arithmetic number, because the mean of its divisors is an integer number (118342480765248).
It is a 1-persistent number, because it is pandigital, but 2⋅828397206165641 = 1656794412331282 is not.
Almost surely, 2828397206165641 is an apocalyptic number.
It is an amenable number.
828397206165641 is a deficient number, since it is larger than the sum of its proper divisors (118342639956343).
828397206165641 is a wasteful number, since it uses less digits than its factorization.
828397206165641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22741591.
The product of its (nonzero) digits is 209018880, while the sum is 68.
The spelling of 828397206165641 in words is "eight hundred twenty-eight trillion, three hundred ninety-seven billion, two hundred six million, one hundred sixty-five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •