Base | Representation |
---|---|
bin | 11101111000010000… |
… | …00001001011111110 |
3 | 1112101221012100112110 |
4 | 32330020001023332 |
5 | 230323011324020 |
6 | 11211424514450 |
7 | 1105341163122 |
oct | 167410011376 |
9 | 45357170473 |
10 | 16041120510 |
11 | 6891881298 |
12 | 313817ba26 |
13 | 1688452aac |
14 | ac25d7582 |
15 | 63d4198e0 |
hex | 3bc2012fe |
16041120510 has 32 divisors (see below), whose sum is σ = 38517321600. Its totient is φ = 4275561888.
The previous prime is 16041120493. The next prime is 16041120517. The reversal of 16041120510 is 1502114061.
16041120510 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16041120517) 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 15 ways as a sum of consecutive naturals, for example, 65860 + ... + 190839.
It is an arithmetic number, because the mean of its divisors is an integer number (1203666300).
Almost surely, 216041120510 is an apocalyptic number.
16041120510 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16041120510 is an abundant number, since it is smaller than the sum of its proper divisors (22476201090).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16041120510 is a wasteful number, since it uses less digits than its factorization.
16041120510 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 258792.
The product of its (nonzero) digits is 240, while the sum is 21.
Adding to 16041120510 its reverse (1502114061), we get a palindrome (17543234571).
The spelling of 16041120510 in words is "sixteen billion, forty-one million, one hundred twenty thousand, five hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •