Base | Representation |
---|---|
bin | 101111000010111100… |
… | …010100010110010001 |
3 | 11211101111022200020220 |
4 | 233002330110112101 |
5 | 1311423344412040 |
6 | 35112324423253 |
7 | 3435546250200 |
oct | 570274242621 |
9 | 154344280226 |
10 | 50515232145 |
11 | 1a472593644 |
12 | 9959547b29 |
13 | 49c0729011 |
14 | 2632d2d237 |
15 | 14a9c1b2d0 |
hex | bc2f14591 |
50515232145 has 24 divisors (see below), whose sum is σ = 94020188544. Its totient is φ = 23092677216.
The previous prime is 50515232137. The next prime is 50515232149. The reversal of 50515232145 is 54123251505.
It is not a de Polignac number, because 50515232145 - 23 = 50515232137 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50515232149) 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 in 23 ways as a sum of consecutive naturals, for example, 34363369 + ... + 34364838.
It is an arithmetic number, because the mean of its divisors is an integer number (3917507856).
Almost surely, 250515232145 is an apocalyptic number.
It is an amenable number.
50515232145 is a deficient number, since it is larger than the sum of its proper divisors (43504956399).
50515232145 is a wasteful number, since it uses less digits than its factorization.
50515232145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68728229 (or 68728222 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 33.
The spelling of 50515232145 in words is "fifty billion, five hundred fifteen million, two hundred thirty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •