Base | Representation |
---|---|
bin | 1110011001101… |
… | …0001100010101 |
3 | 11012122122210001 |
4 | 3212122030111 |
5 | 110430303110 |
6 | 5554331301 |
7 | 1332252322 |
oct | 346321425 |
9 | 135578701 |
10 | 60400405 |
11 | 3110479a |
12 | 18289b31 |
13 | c68a2b0 |
14 | 8043b49 |
15 | 548163a |
hex | 399a315 |
60400405 has 32 divisors (see below), whose sum is σ = 84478464. Its totient is φ = 41051136.
The previous prime is 60400399. The next prime is 60400409. The reversal of 60400405 is 50400406.
60400405 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 60400405 - 217 = 60269333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (60400409) 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 31 ways as a sum of consecutive naturals, for example, 51354 + ... + 52516.
It is an arithmetic number, because the mean of its divisors is an integer number (2639952).
Almost surely, 260400405 is an apocalyptic number.
60400405 is a gapful number since it is divisible by the number (65) formed by its first and last digit.
It is an amenable number.
60400405 is a deficient number, since it is larger than the sum of its proper divisors (24078059).
60400405 is a wasteful number, since it uses less digits than its factorization.
60400405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1245.
The product of its (nonzero) digits is 480, while the sum is 19.
The square root of 60400405 is about 7771.7697469753. The cubic root of 60400405 is about 392.3556855144.
Subtracting from 60400405 its reverse (50400406), we obtain a palindrome (9999999).
The spelling of 60400405 in words is "sixty million, four hundred thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •