Base | Representation |
---|---|
bin | 11000001011100… |
… | …111111001000100 |
3 | 1001021101201000000 |
4 | 120023213321010 |
5 | 1312324401124 |
6 | 104131321300 |
7 | 13024252212 |
oct | 3013477104 |
9 | 1037351000 |
10 | 405700164 |
11 | 1990095a1 |
12 | b3a50230 |
13 | 66088c8c |
14 | 3bc49cb2 |
15 | 2593c6c9 |
hex | 182e7e44 |
405700164 has 63 divisors (see below), whose sum is σ = 1067337453. Its totient is φ = 134870832.
The previous prime is 405700117. The next prime is 405700187. The reversal of 405700164 is 461007504.
The square root of 405700164 is 20142.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 220522500 + 185177664 = 14850^2 + 13608^2 .
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 20 ways as a sum of consecutive naturals, for example, 1087482 + ... + 1087854.
Almost surely, 2405700164 is an apocalyptic number.
405700164 is the 20142-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 405700164
405700164 is an abundant number, since it is smaller than the sum of its proper divisors (661637289).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
405700164 is an frugal number, since it uses more digits than its factorization.
405700164 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 768 (or 378 counting only the distinct ones).
The product of its (nonzero) digits is 3360, while the sum is 27.
The cubic root of 405700164 is about 740.2897355819.
Adding to 405700164 its reverse (461007504), we get a palindrome (866707668).
It can be divided in two parts, 405 and 700164, that added together give a square (700569 = 8372).
The spelling of 405700164 in words is "four hundred five million, seven hundred thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •