Base | Representation |
---|---|
bin | 101000000001111001011… |
… | …1100100001110000100001 |
3 | 201110221200100011022120001 |
4 | 1100003302330201300201 |
5 | 1210114321311421230 |
6 | 15411225452020001 |
7 | 1105323423122356 |
oct | 120036274416041 |
9 | 21427610138501 |
10 | 5501634092065 |
11 | 1831259021571 |
12 | 74a306161601 |
13 | 30ba56923507 |
14 | 1503cda1662d |
15 | 9819ba3a0ca |
hex | 500f2f21c21 |
5501634092065 has 8 divisors (see below), whose sum is σ = 6627649475880. Its totient is φ = 4384181563392.
The previous prime is 5501634091999. The next prime is 5501634092069. The reversal of 5501634092065 is 5602904361055.
It can be written as a sum of positive squares in 4 ways, for example, as 2506145452561 + 2995488639504 = 1583081^2 + 1730748^2 .
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 5501634092065 - 213 = 5501634083873 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5501634092069) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2140712370 + ... + 2140714939.
It is an arithmetic number, because the mean of its divisors is an integer number (828456184485).
Almost surely, 25501634092065 is an apocalyptic number.
It is an amenable number.
5501634092065 is a deficient number, since it is larger than the sum of its proper divisors (1126015383815).
5501634092065 is a wasteful number, since it uses less digits than its factorization.
5501634092065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4281427571.
The product of its (nonzero) digits is 972000, while the sum is 46.
The spelling of 5501634092065 in words is "five trillion, five hundred one billion, six hundred thirty-four million, ninety-two thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •