Base | Representation |
---|---|
bin | 101111000101001101… |
… | …111110001011010001 |
3 | 11211111011011112101202 |
4 | 233011031332023101 |
5 | 1312013133224403 |
6 | 35120211040545 |
7 | 3436521634451 |
oct | 570515761321 |
9 | 154434145352 |
10 | 50553414353 |
11 | 1a4920a2492 |
12 | 996a2a0155 |
13 | 49c8607340 |
14 | 263802bd61 |
15 | 14ad25e688 |
hex | bc537e2d1 |
50553414353 has 4 divisors (see below), whose sum is σ = 54442138548. Its totient is φ = 46664690160.
The previous prime is 50553414343. The next prime is 50553414409. The reversal of 50553414353 is 35341435505.
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 10165277329 + 40388137024 = 100823^2 + 200968^2 .
It is a cyclic number.
It is not a de Polignac number, because 50553414353 - 220 = 50552365777 is a prime.
It is a super-2 number, since 2×505534143532 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50553414343) 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, 1944362078 + ... + 1944362103.
It is an arithmetic number, because the mean of its divisors is an integer number (13610534637).
Almost surely, 250553414353 is an apocalyptic number.
It is an amenable number.
50553414353 is a deficient number, since it is larger than the sum of its proper divisors (3888724195).
50553414353 is a wasteful number, since it uses less digits than its factorization.
50553414353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3888724194.
The product of its (nonzero) digits is 270000, while the sum is 38.
Adding to 50553414353 its reverse (35341435505), we get a palindrome (85894849858).
The spelling of 50553414353 in words is "fifty billion, five hundred fifty-three million, four hundred fourteen thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •