Base | Representation |
---|---|
bin | 10011101110110… |
… | …111010101010010 |
3 | 212001221012110220 |
4 | 103232313111102 |
5 | 1134222133440 |
6 | 52503333510 |
7 | 11126620155 |
oct | 2356672522 |
9 | 761835426 |
10 | 331052370 |
11 | 15a963600 |
12 | 92a51296 |
13 | 53780a9c |
14 | 31d77c9c |
15 | 1e0e48d0 |
hex | 13bb7552 |
331052370 has 48 divisors (see below), whose sum is σ = 873331200. Its totient is φ = 80254240.
The previous prime is 331052353. The next prime is 331052387. The reversal of 331052370 is 73250133.
It is an interprime number because it is at equal distance from previous prime (331052353) and next prime (331052387).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 331052370.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 41970 + ... + 49229.
It is an arithmetic number, because the mean of its divisors is an integer number (18194400).
Almost surely, 2331052370 is an apocalyptic number.
331052370 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
331052370 is an abundant number, since it is smaller than the sum of its proper divisors (542278830).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331052370 is a wasteful number, since it uses less digits than its factorization.
331052370 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91231 (or 91220 counting only the distinct ones).
The product of its (nonzero) digits is 1890, while the sum is 24.
The square root of 331052370 is about 18194.8445995013. The cubic root of 331052370 is about 691.7761215145.
The spelling of 331052370 in words is "three hundred thirty-one million, fifty-two thousand, three hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •