Base | Representation |
---|---|
bin | 10011101011101… |
… | …110110100110010 |
3 | 212000101110220010 |
4 | 103223232310302 |
5 | 1134014343330 |
6 | 52433555350 |
7 | 11116626600 |
oct | 2353566462 |
9 | 760343803 |
10 | 330231090 |
11 | 15a452562 |
12 | 92715b56 |
13 | 53554017 |
14 | 31c02870 |
15 | 1ded13b0 |
hex | 13aeed32 |
330231090 has 96 divisors (see below), whose sum is σ = 926420544. Its totient is φ = 75116160.
The previous prime is 330231089. The next prime is 330231113. The reversal of 330231090 is 90132033.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 406785 + ... + 407595.
It is an arithmetic number, because the mean of its divisors is an integer number (9650214).
Almost surely, 2330231090 is an apocalyptic number.
330231090 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 330231090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (463210272).
330231090 is an abundant number, since it is smaller than the sum of its proper divisors (596189454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330231090 is a wasteful number, since it uses less digits than its factorization.
330231090 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112 (or 1105 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 21.
The square root of 330231090 is about 18172.2615543581. The cubic root of 330231090 is about 691.2035913938.
The spelling of 330231090 in words is "three hundred thirty million, two hundred thirty-one thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •