Base | Representation |
---|---|
bin | 100101000110111010101… |
… | …100111101100001101010 |
3 | 100000210010020010002210102 |
4 | 211012322230331201222 |
5 | 313234444234030200 |
6 | 5231250441345402 |
7 | 352143364660001 |
oct | 45067254754152 |
9 | 10023106102712 |
10 | 2550047955050 |
11 | 8a3518655702 |
12 | 352271a98262 |
13 | 15661237251b |
14 | 8b5cc927c38 |
15 | 464ec7c96d5 |
hex | 251bab3d86a |
2550047955050 has 12 divisors (see below), whose sum is σ = 4743089196486. Its totient is φ = 1020019182000.
The previous prime is 2550047955001. The next prime is 2550047955061. The reversal of 2550047955050 is 505597400552.
It can be written as a sum of positive squares in 3 ways, for example, as 1146062314849 + 1403985640201 = 1070543^2 + 1184899^2 .
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2550047954986 and 2550047955004.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 25500479501 + ... + 25500479600.
Almost surely, 22550047955050 is an apocalyptic number.
2550047955050 is a deficient number, since it is larger than the sum of its proper divisors (2193041241436).
2550047955050 is a wasteful number, since it uses less digits than its factorization.
2550047955050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51000959113 (or 51000959108 counting only the distinct ones).
The product of its (nonzero) digits is 1575000, while the sum is 47.
The spelling of 2550047955050 in words is "two trillion, five hundred fifty billion, forty-seven million, nine hundred fifty-five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •