Base | Representation |
---|---|
bin | 100100110010000111000… |
… | …1011100101001111101001 |
3 | 122220021220112010120012202 |
4 | 1021210032023211033221 |
5 | 1130311442043041203 |
6 | 14430231511545545 |
7 | 1031145611412203 |
oct | 111441613451751 |
9 | 18807815116182 |
10 | 5055414424553 |
11 | 1679a97714949 |
12 | 69793408b2b5 |
13 | 2a89537b48ac |
14 | 13697d215773 |
15 | 8b7825d0388 |
hex | 4990e2e53e9 |
5055414424553 has 4 divisors (see below), whose sum is σ = 5218492309248. Its totient is φ = 4892336539860.
The previous prime is 5055414424549. The next prime is 5055414424583. The reversal of 5055414424553 is 3554244145505.
It is a happy number.
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.
It is a cyclic number.
It is not a de Polignac number, because 5055414424553 - 22 = 5055414424549 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5055414424498 and 5055414424507.
It is not an unprimeable number, because it can be changed into a prime (5055414424583) 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, 81538942301 + ... + 81538942362.
It is an arithmetic number, because the mean of its divisors is an integer number (1304623077312).
Almost surely, 25055414424553 is an apocalyptic number.
It is an amenable number.
5055414424553 is a deficient number, since it is larger than the sum of its proper divisors (163077884695).
5055414424553 is a wasteful number, since it uses less digits than its factorization.
5055414424553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163077884694.
The product of its (nonzero) digits is 4800000, while the sum is 47.
The spelling of 5055414424553 in words is "five trillion, fifty-five billion, four hundred fourteen million, four hundred twenty-four thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •