Base | Representation |
---|---|
bin | 101111110111010… |
… | …0110001000011010 |
3 | 11010221001210212120 |
4 | 1133232212020122 |
5 | 11242122102310 |
6 | 423211122110 |
7 | 54541126323 |
oct | 13756461032 |
9 | 4127053776 |
10 | 1606050330 |
11 | 754634425 |
12 | 389a43336 |
13 | 1c7973951 |
14 | 11342b44a |
15 | 95ee6b70 |
hex | 5fba621a |
1606050330 has 16 divisors (see below), whose sum is σ = 3854520864. Its totient is φ = 428280080.
The previous prime is 1606050307. The next prime is 1606050337. The reversal of 1606050330 is 330506061.
It is a self number, because there is not a number n which added to its sum of digits gives 1606050330.
It is not an unprimeable number, because it can be changed into a prime (1606050337) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 26767476 + ... + 26767535.
It is an arithmetic number, because the mean of its divisors is an integer number (240907554).
Almost surely, 21606050330 is an apocalyptic number.
1606050330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1606050330 is an abundant number, since it is smaller than the sum of its proper divisors (2248470534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1606050330 is a wasteful number, since it uses less digits than its factorization.
1606050330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53535021.
The product of its (nonzero) digits is 1620, while the sum is 24.
The square root of 1606050330 is about 40075.5577628060. The cubic root of 1606050330 is about 1171.0795135669.
Adding to 1606050330 its reverse (330506061), we get a palindrome (1936556391).
The spelling of 1606050330 in words is "one billion, six hundred six million, fifty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •