Base | Representation |
---|---|
bin | 100101100001010010101010… |
… | …010000110110010000110001 |
3 | 210122021022211220220120200111 |
4 | 211201102222100312100301 |
5 | 133112103221003234401 |
6 | 1342543024005421321 |
7 | 46520655631300456 |
oct | 4541225220662061 |
9 | 718238756816614 |
10 | 165015500055601 |
11 | 48640753921a48 |
12 | 1661113910a841 |
13 | 710cb830a8c10 |
14 | 2ca6b156c382d |
15 | 1412672732e51 |
hex | 9614aa436431 |
165015500055601 has 16 divisors (see below), whose sum is σ = 178220463034320. Its totient is φ = 151883894476800.
The previous prime is 165015500055569. The next prime is 165015500055607. The reversal of 165015500055601 is 106550005510561.
It can be written as a sum of positive squares in 8 ways, for example, as 346036886001 + 164669463169600 = 588249^2 + 12832360^2 .
It is a cyclic number.
It is not a de Polignac number, because 165015500055601 - 25 = 165015500055569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (165015500055607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7534291 + ... + 19667143.
It is an arithmetic number, because the mean of its divisors is an integer number (11138778939645).
Almost surely, 2165015500055601 is an apocalyptic number.
It is an amenable number.
165015500055601 is a deficient number, since it is larger than the sum of its proper divisors (13204962978719).
165015500055601 is a wasteful number, since it uses less digits than its factorization.
165015500055601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12135876.
The product of its (nonzero) digits is 112500, while the sum is 40.
The spelling of 165015500055601 in words is "one hundred sixty-five trillion, fifteen billion, five hundred million, fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •