Base | Representation |
---|---|
bin | 1110100011100000100… |
… | …10001001010000000010 |
3 | 1202210211211101210120000 |
4 | 13101300102021100002 |
5 | 31143201100323020 |
6 | 1021424234500430 |
7 | 51062641645545 |
oct | 7216022112002 |
9 | 1683754353500 |
10 | 500100011010 |
11 | 183100467226 |
12 | 80b0a594716 |
13 | 3820ba965a2 |
14 | 1a2c261885c |
15 | d01e7db090 |
hex | 7470489402 |
500100011010 has 40 divisors (see below), whose sum is σ = 1344713365116. Its totient is φ = 133360002720.
The previous prime is 500100010987. The next prime is 500100011011. The reversal of 500100011010 is 10110001005.
It can be written as a sum of positive squares in 2 ways, for example, as 446762570409 + 53337440601 = 668403^2 + 230949^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 500100010983 and 500100011001.
It is not an unprimeable number, because it can be changed into a prime (500100011011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 308702901 + ... + 308704520.
Almost surely, 2500100011010 is an apocalyptic number.
500100011010 is an abundant number, since it is smaller than the sum of its proper divisors (844613354106).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
500100011010 is a wasteful number, since it uses less digits than its factorization.
500100011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617407440 (or 617407431 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 9.
Adding to 500100011010 its reverse (10110001005), we get a palindrome (510210012015).
The spelling of 500100011010 in words is "five hundred billion, one hundred million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •