Base | Representation |
---|---|
bin | 101110111000000011… |
… | …010000010011101111 |
3 | 11210220202110222120021 |
4 | 232320003100103233 |
5 | 1311040110014411 |
6 | 35042240103011 |
7 | 3431200126045 |
oct | 567003202357 |
9 | 153822428507 |
10 | 50332501231 |
11 | 1a389426161 |
12 | 9908304a67 |
13 | 499190a10c |
14 | 2616964395 |
15 | 1498b73a71 |
hex | bb80d04ef |
50332501231 has 8 divisors (see below), whose sum is σ = 51161462064. Its totient is φ = 49503664320.
The previous prime is 50332501223. The next prime is 50332501267. The reversal of 50332501231 is 13210523305.
50332501231 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50332501231 - 23 = 50332501223 is a prime.
It is a super-2 number, since 2×503325012312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50332501196 and 50332501205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50332501031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1163811 + ... + 1206283.
It is an arithmetic number, because the mean of its divisors is an integer number (6395182758).
Almost surely, 250332501231 is an apocalyptic number.
50332501231 is a deficient number, since it is larger than the sum of its proper divisors (828960833).
50332501231 is a wasteful number, since it uses less digits than its factorization.
50332501231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61961.
The product of its (nonzero) digits is 2700, while the sum is 25.
The spelling of 50332501231 in words is "fifty billion, three hundred thirty-two million, five hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •