Base | Representation |
---|---|
bin | 10110110110011101111011… |
… | …00011010110001010100001 |
3 | 20120220212001002001221211020 |
4 | 23123032331203112022201 |
5 | 23041244001123234203 |
6 | 254512311003440053 |
7 | 13404304623163353 |
oct | 1333167543261241 |
9 | 216825032057736 |
10 | 50250002555553 |
11 | 150139a7478369 |
12 | 5776954226029 |
13 | 220672a198118 |
14 | c5a1824c30d3 |
15 | 5c21b7cd1153 |
hex | 2db3bd8d62a1 |
50250002555553 has 4 divisors (see below), whose sum is σ = 67000003407408. Its totient is φ = 33500001703700.
The previous prime is 50250002555537. The next prime is 50250002555587. The reversal of 50250002555553 is 35555520005205.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 50250002555553 - 24 = 50250002555537 is a prime.
It is a super-2 number, since 2×502500025555532 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (50250002555593) 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, 8375000425923 + ... + 8375000425928.
It is an arithmetic number, because the mean of its divisors is an integer number (16750000851852).
Almost surely, 250250002555553 is an apocalyptic number.
It is an amenable number.
50250002555553 is a deficient number, since it is larger than the sum of its proper divisors (16750000851855).
50250002555553 is a wasteful number, since it uses less digits than its factorization.
50250002555553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16750000851854.
The product of its (nonzero) digits is 937500, while the sum is 42.
The spelling of 50250002555553 in words is "fifty trillion, two hundred fifty billion, two million, five hundred fifty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •