Base | Representation |
---|---|
bin | 100110010001001… |
… | …001101011111010 |
3 | 1122202002112001010 |
4 | 212101021223322 |
5 | 2303324432310 |
6 | 143412534350 |
7 | 21624111354 |
oct | 4621115372 |
9 | 1582075033 |
10 | 642030330 |
11 | 2aa455987 |
12 | 15b0213b6 |
13 | a3023606 |
14 | 613a80d4 |
15 | 3b571320 |
hex | 26449afa |
642030330 has 128 divisors (see below), whose sum is σ = 1748044800. Its totient is φ = 149935104.
The previous prime is 642030329. The next prime is 642030341. The reversal of 642030330 is 33030246.
642030330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 642030297 and 642030306.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 571149 + ... + 572271.
It is an arithmetic number, because the mean of its divisors is an integer number (13656600).
Almost surely, 2642030330 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 642030330, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (874022400).
642030330 is an abundant number, since it is smaller than the sum of its proper divisors (1106014470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
642030330 is a wasteful number, since it uses less digits than its factorization.
642030330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1228.
The product of its (nonzero) digits is 1296, while the sum is 21.
The square root of 642030330 is about 25338.3174263802. The cubic root of 642030330 is about 862.6842085019.
Adding to 642030330 its reverse (33030246), we get a palindrome (675060576).
The spelling of 642030330 in words is "six hundred forty-two million, thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •