Base | Representation |
---|---|
bin | 101110101001111001… |
… | …010010111100001001 |
3 | 11210022012121011012220 |
4 | 232221321102330021 |
5 | 1310043310301140 |
6 | 35002513524253 |
7 | 3422254361340 |
oct | 565171227411 |
9 | 153265534186 |
10 | 50095009545 |
11 | 1a277366139 |
12 | 9860873689 |
13 | 4954656ba9 |
14 | 25d31c2b57 |
15 | 1482db0bd0 |
hex | ba9e52f09 |
50095009545 has 32 divisors (see below), whose sum is σ = 91654717440. Its totient is φ = 22887472320.
The previous prime is 50095009529. The next prime is 50095009571. The reversal of 50095009545 is 54590059005.
It is not a de Polignac number, because 50095009545 - 24 = 50095009529 is a prime.
It is a super-2 number, since 2×500950095452 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 50095009497 and 50095009506.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 49080 + ... + 320310.
It is an arithmetic number, because the mean of its divisors is an integer number (2864209920).
Almost surely, 250095009545 is an apocalyptic number.
It is an amenable number.
50095009545 is a deficient number, since it is larger than the sum of its proper divisors (41559707895).
50095009545 is a wasteful number, since it uses less digits than its factorization.
50095009545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273005.
The product of its (nonzero) digits is 202500, while the sum is 42.
The spelling of 50095009545 in words is "fifty billion, ninety-five million, nine thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •