Base | Representation |
---|---|
bin | 1110101001000110011… |
… | …10010000011000011111 |
3 | 1210002121001101101201010 |
4 | 13110203032100120133 |
5 | 31220323120111221 |
6 | 1023042200150303 |
7 | 51230224255440 |
oct | 7244316203037 |
9 | 1702531341633 |
10 | 503102113311 |
11 | 184401033106 |
12 | 81607a68393 |
13 | 38599a35995 |
14 | 1a4c920b2c7 |
15 | d148147c76 |
hex | 752339061f |
503102113311 has 16 divisors (see below), whose sum is σ = 774074822144. Its totient is φ = 284695785504.
The previous prime is 503102113289. The next prime is 503102113313. The reversal of 503102113311 is 113311201305.
It is not a de Polignac number, because 503102113311 - 210 = 503102112287 is a prime.
It is a super-2 number, since 2×5031021133112 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (503102113313) 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 15 ways as a sum of consecutive naturals, for example, 116295136 + ... + 116299461.
It is an arithmetic number, because the mean of its divisors is an integer number (48379676384).
Almost surely, 2503102113311 is an apocalyptic number.
503102113311 is a deficient number, since it is larger than the sum of its proper divisors (270972708833).
503102113311 is a wasteful number, since it uses less digits than its factorization.
503102113311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 232594710.
The product of its (nonzero) digits is 270, while the sum is 21.
Adding to 503102113311 its reverse (113311201305), we get a palindrome (616413314616).
The spelling of 503102113311 in words is "five hundred three billion, one hundred two million, one hundred thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.341 sec. • engine limits •