Base | Representation |
---|---|
bin | 101110110000111111… |
… | …010000010101010001 |
3 | 11210121111112010020011 |
4 | 232300333100111101 |
5 | 1310314241342431 |
6 | 35022404314521 |
7 | 3425231030101 |
oct | 566077202521 |
9 | 153544463204 |
10 | 50214012241 |
11 | 1a328556678 |
12 | 98946a2a41 |
13 | 49731c1ba3 |
14 | 2604d1d201 |
15 | 148d56acb1 |
hex | bb0fd0551 |
50214012241 has 4 divisors (see below), whose sum is σ = 50214475584. Its totient is φ = 50213548900.
The previous prime is 50214012179. The next prime is 50214012271. The reversal of 50214012241 is 14221041205.
50214012241 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, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 50214012241 - 211 = 50214010193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50214012271) 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, 27636 + ... + 318106.
It is an arithmetic number, because the mean of its divisors is an integer number (12553618896).
Almost surely, 250214012241 is an apocalyptic number.
It is an amenable number.
50214012241 is a deficient number, since it is larger than the sum of its proper divisors (463343).
50214012241 is a wasteful number, since it uses less digits than its factorization.
50214012241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 463342.
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 50214012241 its reverse (14221041205), we get a palindrome (64435053446).
The spelling of 50214012241 in words is "fifty billion, two hundred fourteen million, twelve thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •