Base | Representation |
---|---|
bin | 1000011110011100… |
… | …11010011111010011 |
3 | 102202010101110212101 |
4 | 10033032122133103 |
5 | 33304400412201 |
6 | 2031310541231 |
7 | 220522540054 |
oct | 41716323723 |
9 | 12663343771 |
10 | 4550404051 |
11 | 1a25647a06 |
12 | a6bb07817 |
13 | 576973a9b |
14 | 3124aa72b |
15 | 1b9747d01 |
hex | 10f39a7d3 |
4550404051 has 4 divisors (see below), whose sum is σ = 4555240704. Its totient is φ = 4545567400.
The previous prime is 4550404049. The next prime is 4550404057. The reversal of 4550404051 is 1504040554.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1504040554 = 2 ⋅752020277.
It is a cyclic number.
It is not a de Polignac number, because 4550404051 - 21 = 4550404049 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4550404057) 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 3 ways as a sum of consecutive naturals, for example, 2416915 + ... + 2418796.
It is an arithmetic number, because the mean of its divisors is an integer number (1138810176).
Almost surely, 24550404051 is an apocalyptic number.
4550404051 is a deficient number, since it is larger than the sum of its proper divisors (4836653).
4550404051 is an equidigital number, since it uses as much as digits as its factorization.
4550404051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4836652.
The product of its (nonzero) digits is 8000, while the sum is 28.
The square root of 4550404051 is about 67456.6827749483. The cubic root of 4550404051 is about 1657.1048450785.
It can be divided in two parts, 4 and 550404051, that added together give a palindrome (550404055).
The spelling of 4550404051 in words is "four billion, five hundred fifty million, four hundred four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •