Base | Representation |
---|---|
bin | 101100011000110010100… |
… | …011101110001001111010 |
3 | 101210121021220120011002012 |
4 | 230120302203232021322 |
5 | 344433430400130200 |
6 | 10253135455205522 |
7 | 433242441514610 |
oct | 54306243561172 |
9 | 11717256504065 |
10 | 3050275005050 |
11 | a766837a1129 |
12 | 4131b6b168a2 |
13 | 1918415588c0 |
14 | a78c3d716b0 |
15 | 5452830ba35 |
hex | 2c6328ee27a |
3050275005050 has 48 divisors (see below), whose sum is σ = 6982783406592. Its totient is φ = 965361758400.
The previous prime is 3050275005049. The next prime is 3050275005053. The reversal of 3050275005050 is 505005720503.
3050275005050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 3050275004998 and 3050275005016.
It is not an unprimeable number, because it can be changed into a prime (3050275005053) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 335190506 + ... + 335199605.
It is an arithmetic number, because the mean of its divisors is an integer number (145474654304).
Almost surely, 23050275005050 is an apocalyptic number.
3050275005050 is an abundant number, since it is smaller than the sum of its proper divisors (3932508401542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3050275005050 is a wasteful number, since it uses less digits than its factorization.
3050275005050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670390143 (or 670390138 counting only the distinct ones).
The product of its (nonzero) digits is 26250, while the sum is 32.
The spelling of 3050275005050 in words is "three trillion, fifty billion, two hundred seventy-five million, five thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •