Base | Representation |
---|---|
bin | 11010010001001000… |
… | …00001110101000011 |
3 | 1100101210222101011220 |
4 | 31020210001311003 |
5 | 212340142243430 |
6 | 10251205210123 |
7 | 1006316424042 |
oct | 151044016503 |
9 | 40353871156 |
10 | 14102306115 |
11 | 5a87425347 |
12 | 2896a00943 |
13 | 143987c241 |
14 | 97ad08559 |
15 | 5780e1110 |
hex | 348901d43 |
14102306115 has 8 divisors (see below), whose sum is σ = 22563689808. Its totient is φ = 7521229920.
The previous prime is 14102306111. The next prime is 14102306147. The reversal of 14102306115 is 51160320141.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14102306115 - 22 = 14102306111 is a prime.
It is a super-2 number, since 2×141023061152 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14102306111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 470076856 + ... + 470076885.
It is an arithmetic number, because the mean of its divisors is an integer number (2820461226).
Almost surely, 214102306115 is an apocalyptic number.
14102306115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14102306115 is a deficient number, since it is larger than the sum of its proper divisors (8461383693).
14102306115 is an equidigital number, since it uses as much as digits as its factorization.
14102306115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 940153749.
The product of its (nonzero) digits is 720, while the sum is 24.
Adding to 14102306115 its reverse (51160320141), we get a palindrome (65262626256).
The spelling of 14102306115 in words is "fourteen billion, one hundred two million, three hundred six thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •