Base | Representation |
---|---|
bin | 100011110101000… |
… | …010011010101101 |
3 | 1112220002100112122 |
4 | 203311002122231 |
5 | 2212340343333 |
6 | 135351442325 |
7 | 20616213620 |
oct | 4365023255 |
9 | 1486070478 |
10 | 601106093 |
11 | 2893439a5 |
12 | 1493863a5 |
13 | 976c51a3 |
14 | 59b93db7 |
15 | 37b8a798 |
hex | 23d426ad |
601106093 has 8 divisors (see below), whose sum is σ = 696654720. Its totient is φ = 507976560.
The previous prime is 601106063. The next prime is 601106117. The reversal of 601106093 is 390601106.
601106093 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 601106093 - 26 = 601106029 is a prime.
It is a super-2 number, since 2×6011060932 = 722657070083449298, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (601106063) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 604238 + ... + 605231.
It is an arithmetic number, because the mean of its divisors is an integer number (87081840).
Almost surely, 2601106093 is an apocalyptic number.
It is an amenable number.
601106093 is a deficient number, since it is larger than the sum of its proper divisors (95548627).
601106093 is a wasteful number, since it uses less digits than its factorization.
601106093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1209547.
The product of its (nonzero) digits is 972, while the sum is 26.
The square root of 601106093 is about 24517.4650606461. The cubic root of 601106093 is about 843.9506332356.
Adding to 601106093 its reverse (390601106), we get a palindrome (991707199).
The spelling of 601106093 in words is "six hundred one million, one hundred six thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •