Base | Representation |
---|---|
bin | 100100101100100100000… |
… | …1011011000111111011001 |
3 | 122212011011100211200121211 |
4 | 1021121020023120333121 |
5 | 1130113043123113001 |
6 | 14420541511103121 |
7 | 1030244460225655 |
oct | 111311013307731 |
9 | 18764140750554 |
10 | 5043502551001 |
11 | 1674a34784a52 |
12 | 69556a971aa1 |
13 | 2a77a59972c5 |
14 | 13616d1b7a65 |
15 | 8b2d696b351 |
hex | 496482d8fd9 |
5043502551001 has 4 divisors (see below), whose sum is σ = 5217416432100. Its totient is φ = 4869588669904.
The previous prime is 5043502550969. The next prime is 5043502551011. The reversal of 5043502551001 is 1001552053405.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1331021382601 + 3712481168400 = 1153699^2 + 1926780^2 .
It is a cyclic number.
It is not a de Polignac number, because 5043502551001 - 25 = 5043502550969 is a prime.
It is a super-2 number, since 2×50435025510012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5043502551011) 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, 86956940506 + ... + 86956940563.
It is an arithmetic number, because the mean of its divisors is an integer number (1304354108025).
Almost surely, 25043502551001 is an apocalyptic number.
It is an amenable number.
5043502551001 is a deficient number, since it is larger than the sum of its proper divisors (173913881099).
5043502551001 is a wasteful number, since it uses less digits than its factorization.
5043502551001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173913881098.
The product of its (nonzero) digits is 15000, while the sum is 31.
The spelling of 5043502551001 in words is "five trillion, forty-three billion, five hundred two million, five hundred fifty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •