Base | Representation |
---|---|
bin | 100011110110001… |
… | …100110010000010 |
3 | 1112220122211101000 |
4 | 203312030302002 |
5 | 2212430120230 |
6 | 135402152430 |
7 | 20621622636 |
oct | 4366146202 |
9 | 1486584330 |
10 | 601410690 |
11 | 289531831 |
12 | 1494b2716 |
13 | 977a0a1a |
14 | 59c32dc6 |
15 | 37beab60 |
hex | 23d8cc82 |
601410690 has 64 divisors (see below), whose sum is σ = 1606417920. Its totient is φ = 160110720.
The previous prime is 601410631. The next prime is 601410701. The reversal of 601410690 is 96014106.
601410690 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×6014106902 = 723389636092552200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
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, 204007 + ... + 206933.
It is an arithmetic number, because the mean of its divisors is an integer number (25100280).
Almost surely, 2601410690 is an apocalyptic number.
601410690 is an abundant number, since it is smaller than the sum of its proper divisors (1005007230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
601410690 is a wasteful number, since it uses less digits than its factorization.
601410690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3704 (or 3698 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 601410690 is about 24523.6761110564. The cubic root of 601410690 is about 844.0931601681.
Adding to 601410690 its reverse (96014106), we get a palindrome (697424796).
The spelling of 601410690 in words is "six hundred one million, four hundred ten thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •