Base | Representation |
---|---|
bin | 1001100111110001001… |
… | …1101010010100010000 |
3 | 120210122122100202012011 |
4 | 2121330103222110100 |
5 | 10202010314123341 |
6 | 203533554112304 |
7 | 14641101151432 |
oct | 2317423522420 |
9 | 523578322164 |
10 | 165294286096 |
11 | 64112351715 |
12 | 2805087b694 |
13 | 127830755a4 |
14 | 8000adc652 |
15 | 4476674b81 |
hex | 267c4ea510 |
165294286096 has 15 divisors (see below), whose sum is σ = 320260830213. Its totient is φ = 82646329920.
The previous prime is 165294286081. The next prime is 165294286103. The reversal of 165294286096 is 690682492561.
The square root of 165294286096 is 406564.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 5422260496 + 159872025600 = 73636^2 + 399840^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 165294286096.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 1575436 + ... + 1677076.
Almost surely, 2165294286096 is an apocalyptic number.
165294286096 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
165294286096 is the 406564-th square number.
It is an amenable number.
165294286096 is a deficient number, since it is larger than the sum of its proper divisors (154966544117).
165294286096 is an frugal number, since it uses more digits than its factorization.
165294286096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203290 (or 101643 counting only the distinct ones).
The product of its (nonzero) digits is 11197440, while the sum is 58.
The spelling of 165294286096 in words is "one hundred sixty-five billion, two hundred ninety-four million, two hundred eighty-six thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •