Base | Representation |
---|---|
bin | 101111000010111001… |
… | …010011011111110111 |
3 | 11211101102211112200211 |
4 | 233002321103133313 |
5 | 1311423144122411 |
6 | 35112255450251 |
7 | 3435536450221 |
oct | 570271233767 |
9 | 154342745624 |
10 | 50514442231 |
11 | 1a4720a4120 |
12 | 9959226987 |
13 | 49c0510606 |
14 | 2632ba5411 |
15 | 14a9b12221 |
hex | bc2e537f7 |
50514442231 has 24 divisors (see below), whose sum is σ = 57646002960. Its totient is φ = 43895702400.
The previous prime is 50514442217. The next prime is 50514442313. The reversal of 50514442231 is 13224441505.
It is a de Polignac number, because none of the positive numbers 2k-50514442231 is a prime.
It is a super-2 number, since 2×505144422312 (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 = 50514442193 and 50514442202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50514442211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15878461 + ... + 15881641.
It is an arithmetic number, because the mean of its divisors is an integer number (2401916790).
Almost surely, 250514442231 is an apocalyptic number.
50514442231 is a deficient number, since it is larger than the sum of its proper divisors (7131560729).
50514442231 is a wasteful number, since it uses less digits than its factorization.
50514442231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5967 (or 5944 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 50514442231 its reverse (13224441505), we get a palindrome (63738883736).
The spelling of 50514442231 in words is "fifty billion, five hundred fourteen million, four hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •