Base | Representation |
---|---|
bin | 101000000001011001011… |
… | …1111011010000010101001 |
3 | 201110211220120010221002210 |
4 | 1100002302333122002221 |
5 | 1210110122120330230 |
6 | 15410531202115333 |
7 | 1105255013644365 |
oct | 120026277320251 |
9 | 21424816127083 |
10 | 5500561105065 |
11 | 1830858387554 |
12 | 74a06694bb49 |
13 | 30b915540070 |
14 | 15032b30a2a5 |
15 | 9813773ceb0 |
hex | 500b2fda0a9 |
5500561105065 has 128 divisors (see below), whose sum is σ = 10498170074112. Its totient is φ = 2431710167040.
The previous prime is 5500561105063. The next prime is 5500561105163. The reversal of 5500561105065 is 5605011650055.
5500561105065 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5500561105065 - 21 = 5500561105063 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5500561105063) 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 127 ways as a sum of consecutive naturals, for example, 30178405 + ... + 30360125.
It is an arithmetic number, because the mean of its divisors is an integer number (82016953704).
Almost surely, 25500561105065 is an apocalyptic number.
It is an amenable number.
5500561105065 is a deficient number, since it is larger than the sum of its proper divisors (4997608969047).
5500561105065 is a wasteful number, since it uses less digits than its factorization.
5500561105065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182179.
The product of its (nonzero) digits is 112500, while the sum is 39.
The spelling of 5500561105065 in words is "five trillion, five hundred billion, five hundred sixty-one million, one hundred five thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •