Base | Representation |
---|---|
bin | 101110100110000111… |
… | …011101010001001101 |
3 | 11210010210022021111220 |
4 | 232212013131101031 |
5 | 1304431043104010 |
6 | 34552331033553 |
7 | 3420554456643 |
oct | 564607352115 |
9 | 153123267456 |
10 | 50031613005 |
11 | 1a2445a5400 |
12 | 984359b8b9 |
13 | 494448ac4a |
14 | 25c89dd193 |
15 | 147c53b970 |
hex | ba61dd44d |
50031613005 has 48 divisors (see below), whose sum is σ = 88860989952. Its totient is φ = 24017488000.
The previous prime is 50031613001. The next prime is 50031613033.
50031613005 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 50031613005 - 22 = 50031613001 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50031613001) 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 47 ways as a sum of consecutive naturals, for example, 46852 + ... + 319778.
It is an arithmetic number, because the mean of its divisors is an integer number (1851270624).
Almost surely, 250031613005 is an apocalyptic number.
50031613005 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50031613005 is a deficient number, since it is larger than the sum of its proper divisors (38829376947).
50031613005 is a wasteful number, since it uses less digits than its factorization.
50031613005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273058 (or 273047 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 24.
The spelling of 50031613005 in words is "fifty billion, thirty-one million, six hundred thirteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •