Base | Representation |
---|---|
bin | 101110111110001011… |
… | …011010111111101101 |
3 | 11211011220220222110001 |
4 | 232332023122333231 |
5 | 1311242414233303 |
6 | 35100351344301 |
7 | 3433556010601 |
oct | 567613327755 |
9 | 154156828401 |
10 | 50435305453 |
11 | 1a431462525 |
12 | 9936822091 |
13 | 49a9cc3110 |
14 | 2626485501 |
15 | 14a2bce31d |
hex | bbe2dafed |
50435305453 has 4 divisors (see below), whose sum is σ = 54314944348. Its totient is φ = 46555666560.
The previous prime is 50435305409. The next prime is 50435305469. The reversal of 50435305453 is 35450353405.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 34477805124 + 15957500329 = 185682^2 + 126323^2 .
It is a de Polignac number, because none of the positive numbers 2k-50435305453 is a prime.
It is a super-2 number, since 2×504353054532 (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 (50435305553) 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, 1939819428 + ... + 1939819453.
It is an arithmetic number, because the mean of its divisors is an integer number (13578736087).
Almost surely, 250435305453 is an apocalyptic number.
It is an amenable number.
50435305453 is a deficient number, since it is larger than the sum of its proper divisors (3879638895).
50435305453 is a wasteful number, since it uses less digits than its factorization.
50435305453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3879638894.
The product of its (nonzero) digits is 270000, while the sum is 37.
Adding to 50435305453 its reverse (35450353405), we get a palindrome (85885658858).
The spelling of 50435305453 in words is "fifty billion, four hundred thirty-five million, three hundred five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •