Base | Representation |
---|---|
bin | 101110101010001101… |
… | …111100101100001001 |
3 | 11210022120210012200021 |
4 | 232222031330230021 |
5 | 1310101202022213 |
6 | 35003225540441 |
7 | 3422351400304 |
oct | 565215745411 |
9 | 153276705607 |
10 | 50100423433 |
11 | 1a27a423725 |
12 | 9862644721 |
13 | 4955801188 |
14 | 25d3bd1b3b |
15 | 14835ced8d |
hex | baa37cb09 |
50100423433 has 4 divisors (see below), whose sum is σ = 50101873360. Its totient is φ = 50098973508.
The previous prime is 50100423419. The next prime is 50100423481. The reversal of 50100423433 is 33432400105.
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 50100423433 - 29 = 50100422921 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50100423398 and 50100423407.
It is not an unprimeable number, because it can be changed into a prime (50100423493) 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, 671835 + ... + 742672.
It is an arithmetic number, because the mean of its divisors is an integer number (12525468340).
Almost surely, 250100423433 is an apocalyptic number.
It is an amenable number.
50100423433 is a deficient number, since it is larger than the sum of its proper divisors (1449927).
50100423433 is a wasteful number, since it uses less digits than its factorization.
50100423433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1449926.
The product of its (nonzero) digits is 4320, while the sum is 25.
Adding to 50100423433 its reverse (33432400105), we get a palindrome (83532823538).
The spelling of 50100423433 in words is "fifty billion, one hundred million, four hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •