Base | Representation |
---|---|
bin | 101111010010010100… |
… | …011000111001010101 |
3 | 11212001110201211021021 |
4 | 233102110120321111 |
5 | 1312440414403334 |
6 | 35154101521141 |
7 | 3445131040345 |
oct | 572224307125 |
9 | 155043654237 |
10 | 50773200469 |
11 | 1a59516a002 |
12 | 9a0ba131b1 |
13 | 4a31ccb5b4 |
14 | 26592c0d25 |
15 | 14c26c63b4 |
hex | bd2518e55 |
50773200469 has 4 divisors (see below), whose sum is σ = 50816560480. Its totient is φ = 50729840460.
The previous prime is 50773200451. The next prime is 50773200479. The reversal of 50773200469 is 96400237705.
50773200469 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 50773200469 - 215 = 50773167701 is a prime.
It is a super-2 number, since 2×507732004692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50773200409) 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, 21678249 + ... + 21680590.
It is an arithmetic number, because the mean of its divisors is an integer number (12704140120).
Almost surely, 250773200469 is an apocalyptic number.
It is an amenable number.
50773200469 is a deficient number, since it is larger than the sum of its proper divisors (43360011).
50773200469 is a wasteful number, since it uses less digits than its factorization.
50773200469 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43360010.
The product of its (nonzero) digits is 317520, while the sum is 43.
The spelling of 50773200469 in words is "fifty billion, seven hundred seventy-three million, two hundred thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •