Base | Representation |
---|---|
bin | 100101100001010110111001… |
… | …011110010011000100001111 |
3 | 210122021202121000211012222001 |
4 | 211201112321132103010033 |
5 | 133112142030323110431 |
6 | 1342545055311133131 |
7 | 46521206452036120 |
oct | 4541267136230417 |
9 | 718252530735861 |
10 | 165020050206991 |
11 | 48642679307041 |
12 | 16611ba8b141a7 |
13 | 71104299919a5 |
14 | 2ca7027b26047 |
15 | 141283be2ae61 |
hex | 9615b979310f |
165020050206991 has 8 divisors (see below), whose sum is σ = 188594424935424. Its totient is φ = 141445695939000.
The previous prime is 165020050206941. The next prime is 165020050207013. The reversal of 165020050206991 is 199602050020561.
165020050206991 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 165020050206991 - 223 = 165020041818383 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (165020050206941) 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, 21178026 + ... + 27902488.
It is an arithmetic number, because the mean of its divisors is an integer number (23574303116928).
Almost surely, 2165020050206991 is an apocalyptic number.
165020050206991 is a deficient number, since it is larger than the sum of its proper divisors (23574374728433).
165020050206991 is an equidigital number, since it uses as much as digits as its factorization.
165020050206991 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10230221.
The product of its (nonzero) digits is 291600, while the sum is 46.
The spelling of 165020050206991 in words is "one hundred sixty-five trillion, twenty billion, fifty million, two hundred six thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •