Base | Representation |
---|---|
bin | 10110101111010101101011… |
… | …00011101000100111110001 |
3 | 20120001102210021112222020211 |
4 | 23113222311203220213301 |
5 | 23023240323122340203 |
6 | 254204001045304121 |
7 | 13350513612523465 |
oct | 1327526543504761 |
9 | 216042707488224 |
10 | 50005055277553 |
11 | 14a2a030090a22 |
12 | 5737393a05041 |
13 | 21b95c1b6717c |
14 | c4c386b784a5 |
15 | 5bab2d884c6d |
hex | 2d7ab58e89f1 |
50005055277553 has 8 divisors (see below), whose sum is σ = 50084460000000. Its totient is φ = 49925695562160.
The previous prime is 50005055277539. The next prime is 50005055277559. The reversal of 50005055277553 is 35577255050005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50005055277553 - 29 = 50005055277041 is a prime.
It is a super-2 number, since 2×500050552775532 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50005055277497 and 50005055277506.
It is not an unprimeable number, because it can be changed into a prime (50005055277559) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9027553 + ... + 13472446.
It is an arithmetic number, because the mean of its divisors is an integer number (6260557500000).
Almost surely, 250005055277553 is an apocalyptic number.
It is an amenable number.
50005055277553 is a deficient number, since it is larger than the sum of its proper divisors (79404722447).
50005055277553 is a wasteful number, since it uses less digits than its factorization.
50005055277553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22503527.
The product of its (nonzero) digits is 4593750, while the sum is 49.
The spelling of 50005055277553 in words is "fifty trillion, five billion, fifty-five million, two hundred seventy-seven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •