Base | Representation |
---|---|
bin | 10000000010110010001… |
… | …11101100101001110111 |
3 | 1221200212122000110202201 |
4 | 20001121013230221313 |
5 | 33012430224112043 |
6 | 1101124034045331 |
7 | 54553341136216 |
oct | 10013107545167 |
9 | 1850778013681 |
10 | 551251004023 |
11 | 1a2869903375 |
12 | 8aa04a19847 |
13 | 3cca112c365 |
14 | 1c975b5d07d |
15 | e51523ac4d |
hex | 80591eca77 |
551251004023 has 4 divisors (see below), whose sum is σ = 552446776728. Its totient is φ = 550055231320.
The previous prime is 551251004021. The next prime is 551251004039. The reversal of 551251004023 is 320400152155.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 551251004023 - 21 = 551251004021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 551251003982 and 551251004000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (551251004021) 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, 597885661 + ... + 597886582.
It is an arithmetic number, because the mean of its divisors is an integer number (138111694182).
Almost surely, 2551251004023 is an apocalyptic number.
551251004023 is a deficient number, since it is larger than the sum of its proper divisors (1195772705).
551251004023 is a wasteful number, since it uses less digits than its factorization.
551251004023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1195772704.
The product of its (nonzero) digits is 6000, while the sum is 28.
Adding to 551251004023 its reverse (320400152155), we get a palindrome (871651156178).
The spelling of 551251004023 in words is "five hundred fifty-one billion, two hundred fifty-one million, four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •