Base | Representation |
---|---|
bin | 1110101001010011101… |
… | …01011100110011110101 |
3 | 1210002212210010121210001 |
4 | 13110221311130303311 |
5 | 31221040020114000 |
6 | 1023101202031301 |
7 | 51233042234341 |
oct | 7245165346365 |
9 | 1702783117701 |
10 | 503213051125 |
11 | 184458715354 |
12 | 81639048531 |
13 | 385b6a08b65 |
14 | 1a4d9c48621 |
15 | d152c5d46a |
hex | 7529d5ccf5 |
503213051125 has 8 divisors (see below), whose sum is σ = 628009887960. Its totient is φ = 402570440800.
The previous prime is 503213051111. The next prime is 503213051129. The reversal of 503213051125 is 521150312305.
It can be written as a sum of positive squares in 4 ways, for example, as 83161294129 + 420051756996 = 288377^2 + 648114^2 .
It is not a de Polignac number, because 503213051125 - 27 = 503213050997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 503213051093 and 503213051102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (503213051129) 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 7 ways as a sum of consecutive naturals, for example, 2012852080 + ... + 2012852329.
It is an arithmetic number, because the mean of its divisors is an integer number (78501235995).
Almost surely, 2503213051125 is an apocalyptic number.
It is an amenable number.
503213051125 is a deficient number, since it is larger than the sum of its proper divisors (124796836835).
503213051125 is an equidigital number, since it uses as much as digits as its factorization.
503213051125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4025704424 (or 4025704414 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 28.
The spelling of 503213051125 in words is "five hundred three billion, two hundred thirteen million, fifty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •