Base | Representation |
---|---|
bin | 11010111000011101… |
… | …11000000001100111 |
3 | 1101020210221001220021 |
4 | 31130032320001213 |
5 | 214024132232010 |
6 | 10344034220011 |
7 | 1020434366464 |
oct | 153416700147 |
9 | 41223831807 |
10 | 14432305255 |
11 | 6136729605 |
12 | 2969424607 |
13 | 14900517c4 |
14 | 9aca8a66b |
15 | 5970788da |
hex | 35c3b8067 |
14432305255 has 8 divisors (see below), whose sum is σ = 17562693024. Its totient is φ = 11383226400.
The previous prime is 14432305231. The next prime is 14432305289. The reversal of 14432305255 is 55250323441.
14432305255 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 not a de Polignac number, because 14432305255 - 219 = 14431780967 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14432305255.
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 7 ways as a sum of consecutive naturals, for example, 20326836 + ... + 20327545.
It is an arithmetic number, because the mean of its divisors is an integer number (2195336628).
Almost surely, 214432305255 is an apocalyptic number.
14432305255 is a deficient number, since it is larger than the sum of its proper divisors (3130387769).
14432305255 is an equidigital number, since it uses as much as digits as its factorization.
14432305255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40654457.
The product of its (nonzero) digits is 72000, while the sum is 34.
Adding to 14432305255 its reverse (55250323441), we get a palindrome (69682628696).
The spelling of 14432305255 in words is "fourteen billion, four hundred thirty-two million, three hundred five thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •