Base | Representation |
---|---|
bin | 101110111100001000… |
… | …101000110010101111 |
3 | 11211002112102011011022 |
4 | 232330020220302233 |
5 | 1311210130133403 |
6 | 35053124444355 |
7 | 3432661416326 |
oct | 567410506257 |
9 | 154075364138 |
10 | 50401021103 |
11 | 1a414076154 |
12 | 99272496bb |
13 | 49a2b7b014 |
14 | 2621abd0bd |
15 | 149ebaad38 |
hex | bbc228caf |
50401021103 has 4 divisors (see below), whose sum is σ = 50401548120. Its totient is φ = 50400494088.
The previous prime is 50401021093. The next prime is 50401021109. The reversal of 50401021103 is 30112010405.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 30112010405 = 5 ⋅6022402081.
It is a cyclic number.
It is not a de Polignac number, because 50401021103 - 24 = 50401021087 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50401021109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75200 + ... + 326277.
It is an arithmetic number, because the mean of its divisors is an integer number (12600387030).
Almost surely, 250401021103 is an apocalyptic number.
50401021103 is a deficient number, since it is larger than the sum of its proper divisors (527017).
50401021103 is a wasteful number, since it uses less digits than its factorization.
50401021103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527016.
The product of its (nonzero) digits is 120, while the sum is 17.
Adding to 50401021103 its reverse (30112010405), we get a palindrome (80513031508).
The spelling of 50401021103 in words is "fifty billion, four hundred one million, twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •