Base | Representation |
---|---|
bin | 1110100100010011110… |
… | …11011000000100101111 |
3 | 1202211221210222012112120 |
4 | 13102021323120010233 |
5 | 31200041221000111 |
6 | 1021535044204023 |
7 | 51106414632660 |
oct | 7221173300457 |
9 | 1684853865476 |
10 | 500530250031 |
11 | 183301306169 |
12 | 8100a699613 |
13 | 38279c648a6 |
14 | 1a323811367 |
15 | d047474406 |
hex | 7489ed812f |
500530250031 has 16 divisors (see below), whose sum is σ = 764474237184. Its totient is φ = 285356732544.
The previous prime is 500530249969. The next prime is 500530250047. The reversal of 500530250031 is 130052035005.
500530250031 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 500530250031 - 219 = 500529725743 is a prime.
It is a super-2 number, since 2×5005302500312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 500530249983 and 500530250010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (500530250071) 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, 27513741 + ... + 27531926.
It is an arithmetic number, because the mean of its divisors is an integer number (47779639824).
Almost surely, 2500530250031 is an apocalyptic number.
500530250031 is a deficient number, since it is larger than the sum of its proper divisors (263943987153).
500530250031 is a wasteful number, since it uses less digits than its factorization.
500530250031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55046110.
The product of its (nonzero) digits is 2250, while the sum is 24.
Adding to 500530250031 its reverse (130052035005), we get a palindrome (630582285036).
The spelling of 500530250031 in words is "five hundred billion, five hundred thirty million, two hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •