Base | Representation |
---|---|
bin | 101111000001010001… |
… | …111010011110101010 |
3 | 11211022112211112221120 |
4 | 233001101322132222 |
5 | 1311344224321142 |
6 | 35105450520110 |
7 | 3435060204636 |
oct | 570121723652 |
9 | 154275745846 |
10 | 50487338922 |
11 | 1a458871a99 |
12 | 9950136036 |
13 | 49b7a10c57 |
14 | 262d34bdc6 |
15 | 14a755b7ec |
hex | bc147a7aa |
50487338922 has 16 divisors (see below), whose sum is σ = 106914364992. Its totient is φ = 15839165120.
The previous prime is 50487338861. The next prime is 50487338933. The reversal of 50487338922 is 22983378405.
It is a super-2 number, since 2×504873389222 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (51).
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 7 ways as a sum of consecutive naturals, for example, 247486854 + ... + 247487057.
It is an arithmetic number, because the mean of its divisors is an integer number (6682147812).
Almost surely, 250487338922 is an apocalyptic number.
50487338922 is an abundant number, since it is smaller than the sum of its proper divisors (56427026070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50487338922 is a wasteful number, since it uses less digits than its factorization.
50487338922 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 494973933.
The product of its (nonzero) digits is 2903040, while the sum is 51.
The spelling of 50487338922 in words is "fifty billion, four hundred eighty-seven million, three hundred thirty-eight thousand, nine hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •