Base | Representation |
---|---|
bin | 101000000100100110101… |
… | …0001010001011101001111 |
3 | 201111111200021100221012000 |
4 | 1100021031101101131033 |
5 | 1210213221234301210 |
6 | 15414030212043343 |
7 | 1105620415252005 |
oct | 120111521213517 |
9 | 21444607327160 |
10 | 5507444447055 |
11 | 183376a8a2241 |
12 | 74b468003553 |
13 | 30c47161c2a5 |
14 | 1507c157aa75 |
15 | 983dbbb1ac0 |
hex | 5024d45174f |
5507444447055 has 64 divisors (see below), whose sum is σ = 10367529448320. Its totient is φ = 2764367751168.
The previous prime is 5507444447053. The next prime is 5507444447081.
5507444447055 is a `hidden beast` number, since 5 + 50 + 74 + 4 + 4 + 4 + 470 + 55 = 666.
5507444447055 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 5507444447055 - 21 = 5507444447053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5507444446992 and 5507444447010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5507444447053) 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 63 ways as a sum of consecutive naturals, for example, 49270609 + ... + 49382261.
It is an arithmetic number, because the mean of its divisors is an integer number (161992647630).
Almost surely, 25507444447055 is an apocalyptic number.
5507444447055 is a deficient number, since it is larger than the sum of its proper divisors (4860085001265).
5507444447055 is a wasteful number, since it uses less digits than its factorization.
5507444447055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133177 (or 133171 counting only the distinct ones).
The product of its (nonzero) digits is 31360000, while the sum is 54.
The spelling of 5507444447055 in words is "five trillion, five hundred seven billion, four hundred forty-four million, four hundred forty-seven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •