Base | Representation |
---|---|
bin | 101110100100001111… |
… | …000100110011101001 |
3 | 11210001120220222210111 |
4 | 232210033010303221 |
5 | 1304400003234104 |
6 | 34545242414321 |
7 | 3420022313434 |
oct | 564417046351 |
9 | 153046828714 |
10 | 50000055529 |
11 | 1a228800846 |
12 | 9834b013a1 |
13 | 493aa8c098 |
14 | 25c474681b |
15 | 14798a6404 |
hex | ba43c4ce9 |
50000055529 has 8 divisors (see below), whose sum is σ = 53168455080. Its totient is φ = 46856902656.
The previous prime is 50000055499. The next prime is 50000055551. The reversal of 50000055529 is 92555000005.
50000055529 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 15418933929 + 34581121600 = 124173^2 + 185960^2 .
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 50000055529 - 27 = 50000055401 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50000055529.
It is not an unprimeable number, because it can be changed into a prime (50000055229) 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, 6307584 + ... + 6315505.
It is an arithmetic number, because the mean of its divisors is an integer number (6646056885).
Almost surely, 250000055529 is an apocalyptic number.
It is an amenable number.
50000055529 is a deficient number, since it is larger than the sum of its proper divisors (3168399551).
50000055529 is a wasteful number, since it uses less digits than its factorization.
50000055529 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12623339.
The product of its (nonzero) digits is 11250, while the sum is 31.
The spelling of 50000055529 in words is "fifty billion, fifty-five thousand, five hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •