Base | Representation |
---|---|
bin | 11101111000100… |
… | …011010110001001 |
3 | 1021221101221020221 |
4 | 131320203112021 |
5 | 2011322122410 |
6 | 121425550041 |
7 | 15265344634 |
oct | 3570432611 |
9 | 1257357227 |
10 | 501364105 |
11 | 238009300 |
12 | 11baa5321 |
13 | 7cb41c68 |
14 | 4a82cc1b |
15 | 2e0374da |
hex | 1de23589 |
501364105 has 12 divisors (see below), whose sum is σ = 661304196. Its totient is φ = 364628000.
The previous prime is 501364103. The next prime is 501364111. The reversal of 501364105 is 501463105.
It can be written as a sum of positive squares in 2 ways, for example, as 338265664 + 163098441 = 18392^2 + 12771^2 .
It is not a de Polignac number, because 501364105 - 21 = 501364103 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 501364105.
It is not an unprimeable number, because it can be changed into a prime (501364103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 413746 + ... + 414955.
It is an arithmetic number, because the mean of its divisors is an integer number (55108683).
Almost surely, 2501364105 is an apocalyptic number.
501364105 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
501364105 is a deficient number, since it is larger than the sum of its proper divisors (159940091).
501364105 is a wasteful number, since it uses less digits than its factorization.
501364105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 828728 (or 828717 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 501364105 is about 22391.1613142329. The cubic root of 501364105 is about 794.4216644794.
The spelling of 501364105 in words is "five hundred one million, three hundred sixty-four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •