Base | Representation |
---|---|
bin | 1110010101000… |
… | …1011100000001 |
3 | 11012002111222212 |
4 | 3211101130001 |
5 | 110341234101 |
6 | 5544111505 |
7 | 1326601442 |
oct | 345213401 |
9 | 135074885 |
10 | 60102401 |
11 | 30a20907 |
12 | 18165595 |
13 | c5b4768 |
14 | 7da72c9 |
15 | 54231bb |
hex | 3951701 |
60102401 has 4 divisors (see below), whose sum is σ = 60326100. Its totient is φ = 59878704.
The previous prime is 60102391. The next prime is 60102421. The reversal of 60102401 is 10420106.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6885376 + 53217025 = 2624^2 + 7295^2 .
It is a cyclic number.
It is not a de Polignac number, because 60102401 - 214 = 60086017 is a prime.
It is a super-2 number, since 2×601024012 = 7224597211929602, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (60102421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 111446 + ... + 111983.
It is an arithmetic number, because the mean of its divisors is an integer number (15081525).
Almost surely, 260102401 is an apocalyptic number.
It is an amenable number.
60102401 is a deficient number, since it is larger than the sum of its proper divisors (223699).
60102401 is a wasteful number, since it uses less digits than its factorization.
60102401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223698.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 60102401 is about 7752.5738306707. The cubic root of 60102401 is about 391.7093521809.
Adding to 60102401 its reverse (10420106), we get a palindrome (70522507).
The spelling of 60102401 in words is "sixty million, one hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •