Base | Representation |
---|---|
bin | 101000011001000111110… |
… | …0001010001100011100101 |
3 | 201122201101222012222021020 |
4 | 1100302033201101203211 |
5 | 1211423440414022411 |
6 | 15450154303441353 |
7 | 1112040325051611 |
oct | 120621741214345 |
9 | 21581358188236 |
10 | 5551505610981 |
11 | 185042020a900 |
12 | 757b03bb6259 |
13 | 313673b89c15 |
14 | 1529a1260341 |
15 | 99619ea1606 |
hex | 50c8f8518e5 |
5551505610981 has 12 divisors (see below), whose sum is σ = 8136090868416. Its totient is φ = 3364548854920.
The previous prime is 5551505610977. The next prime is 5551505610997. The reversal of 5551505610981 is 1890165051555.
It is not a de Polignac number, because 5551505610981 - 22 = 5551505610977 is a prime.
It is a super-2 number, since 2×55515056109812 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5551505610281) 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 11 ways as a sum of consecutive naturals, for example, 7646701581 + ... + 7646702306.
It is an arithmetic number, because the mean of its divisors is an integer number (678007572368).
Almost surely, 25551505610981 is an apocalyptic number.
It is an amenable number.
5551505610981 is a deficient number, since it is larger than the sum of its proper divisors (2584585257435).
5551505610981 is a wasteful number, since it uses less digits than its factorization.
5551505610981 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15293403912 (or 15293403901 counting only the distinct ones).
The product of its (nonzero) digits is 1350000, while the sum is 51.
The spelling of 5551505610981 in words is "five trillion, five hundred fifty-one billion, five hundred five million, six hundred ten thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •