Base | Representation |
---|---|
bin | 101000000001101010010… |
… | …0110111101111111001001 |
3 | 201110220100212110001200111 |
4 | 1100003110212331333021 |
5 | 1210112301012432131 |
6 | 15411103151034321 |
7 | 1105305003014521 |
oct | 120032446757711 |
9 | 21426325401614 |
10 | 5501125124041 |
11 | 183101779a338 |
12 | 74a1a380b9a1 |
13 | 30b9a534b4c1 |
14 | 1503821a8681 |
15 | 9816beeeab1 |
hex | 500d49bdfc9 |
5501125124041 has 4 divisors (see below), whose sum is σ = 5501131373584. Its totient is φ = 5501118874500.
The previous prime is 5501125123969. The next prime is 5501125124071. The reversal of 5501125124041 is 1404215211055.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5501125124041 - 229 = 5500588253129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5501125123994 and 5501125124012.
It is not an unprimeable number, because it can be changed into a prime (5501125124071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1534695 + ... + 3654796.
It is an arithmetic number, because the mean of its divisors is an integer number (1375282843396).
Almost surely, 25501125124041 is an apocalyptic number.
It is an amenable number.
5501125124041 is a deficient number, since it is larger than the sum of its proper divisors (6249543).
5501125124041 is a wasteful number, since it uses less digits than its factorization.
5501125124041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6249542.
The product of its (nonzero) digits is 8000, while the sum is 31.
The spelling of 5501125124041 in words is "five trillion, five hundred one billion, one hundred twenty-five million, one hundred twenty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •