Base | Representation |
---|---|
bin | 11011010001001111… |
… | …00100011101100001 |
3 | 1101210021221101222201 |
4 | 31220213210131201 |
5 | 214440331332223 |
6 | 10420420133201 |
7 | 1025536561531 |
oct | 155047443541 |
9 | 41707841881 |
10 | 14640105313 |
11 | 6232a59899 |
12 | 2a06b37201 |
13 | 14c410a212 |
14 | 9cc4dd4c1 |
15 | 5aa423ead |
hex | 3689e4761 |
14640105313 has 8 divisors (see below), whose sum is σ = 14860486368. Its totient is φ = 14420771904.
The previous prime is 14640105307. The next prime is 14640105317. The reversal of 14640105313 is 31350104641.
14640105313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14640105313 - 25 = 14640105281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14640105317) 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, 233731 + ... + 289672.
It is an arithmetic number, because the mean of its divisors is an integer number (1857560796).
Almost surely, 214640105313 is an apocalyptic number.
It is an amenable number.
14640105313 is a deficient number, since it is larger than the sum of its proper divisors (220381055).
14640105313 is an equidigital number, since it uses as much as digits as its factorization.
14640105313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523823.
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 14640105313 its reverse (31350104641), we get a palindrome (45990209954).
The spelling of 14640105313 in words is "fourteen billion, six hundred forty million, one hundred five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •