Base | Representation |
---|---|
bin | 101110101010110110… |
… | …010000100010100011 |
3 | 11210100022200001222002 |
4 | 232222312100202203 |
5 | 1310111403143444 |
6 | 35004244234215 |
7 | 3422540251133 |
oct | 565266204243 |
9 | 153308601862 |
10 | 50110990499 |
11 | 1a285390939 |
12 | 986609b96b |
13 | 4957a60b8b |
14 | 25d5382ac3 |
15 | 14844bad4e |
hex | baad908a3 |
50110990499 has 2 divisors, whose sum is σ = 50110990500. Its totient is φ = 50110990498.
The previous prime is 50110990483. The next prime is 50110990519. The reversal of 50110990499 is 99409901105.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 50110990499 - 24 = 50110990483 is a prime.
It is a super-2 number, since 2×501109904992 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (50110990409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25055495249 + 25055495250.
It is an arithmetic number, because the mean of its divisors is an integer number (25055495250).
Almost surely, 250110990499 is an apocalyptic number.
50110990499 is a deficient number, since it is larger than the sum of its proper divisors (1).
50110990499 is an equidigital number, since it uses as much as digits as its factorization.
50110990499 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 131220, while the sum is 47.
The spelling of 50110990499 in words is "fifty billion, one hundred ten million, nine hundred ninety thousand, four hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •