Base | Representation |
---|---|
bin | 1101010010111010001010 |
3 | 20120001222000 |
4 | 31102322022 |
5 | 1343012242 |
6 | 202411430 |
7 | 41424201 |
oct | 15227212 |
9 | 6501860 |
10 | 3485322 |
11 | 1a70635 |
12 | 1200b76 |
13 | 950529 |
14 | 66a238 |
15 | 48ca4c |
hex | 352e8a |
3485322 has 64 divisors (see below), whose sum is σ = 8448000. Its totient is φ = 1061424.
The previous prime is 3485297. The next prime is 3485327. The reversal of 3485322 is 2235843.
3485322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (3485327) 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 31 ways as a sum of consecutive naturals, for example, 44079 + ... + 44157.
It is an arithmetic number, because the mean of its divisors is an integer number (132000).
Almost surely, 23485322 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3485322, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4224000).
3485322 is an abundant number, since it is smaller than the sum of its proper divisors (4962678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3485322 is a wasteful number, since it uses less digits than its factorization.
3485322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152 (or 146 counting only the distinct ones).
The product of its digits is 5760, while the sum is 27.
The square root of 3485322 is about 1866.9017113924. The cubic root of 3485322 is about 151.6169080958.
The spelling of 3485322 in words is "three million, four hundred eighty-five thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.266 sec. • engine limits •