Base | Representation |
---|---|
bin | 1110100011100010001… |
… | …00010001101111110101 |
3 | 1202210212202010110222212 |
4 | 13101301010101233311 |
5 | 31143212431344023 |
6 | 1021425424303205 |
7 | 51063161442455 |
oct | 7216104215765 |
9 | 1683782113885 |
10 | 500113153013 |
11 | 183107922a91 |
12 | 80b12a71b05 |
13 | 38211718316 |
14 | 1a2c4279d65 |
15 | d020a34e78 |
hex | 7471111bf5 |
500113153013 has 16 divisors (see below), whose sum is σ = 526414049280. Its totient is φ = 474207627696.
The previous prime is 500113153003. The next prime is 500113153063. The reversal of 500113153013 is 310351311005.
It is a cyclic number.
It is not a de Polignac number, because 500113153013 - 224 = 500096375797 is a prime.
It is a super-2 number, since 2×5001131530132 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 500113153013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (500113153003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1232258 + ... + 1587036.
It is an arithmetic number, because the mean of its divisors is an integer number (32900878080).
Almost surely, 2500113153013 is an apocalyptic number.
It is an amenable number.
500113153013 is a deficient number, since it is larger than the sum of its proper divisors (26300896267).
500113153013 is a wasteful number, since it uses less digits than its factorization.
500113153013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 355336.
The product of its (nonzero) digits is 675, while the sum is 23.
Adding to 500113153013 its reverse (310351311005), we get a palindrome (810464464018).
The spelling of 500113153013 in words is "five hundred billion, one hundred thirteen million, one hundred fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •