Base | Representation |
---|---|
bin | 1101000111111111110000… |
… | …0001100011001101010101 |
3 | 1220002120222211111221112120 |
4 | 3101333330001203031111 |
5 | 3342414213443141203 |
6 | 50405304242410153 |
7 | 3016415133041043 |
oct | 321777401431525 |
9 | 56076884457476 |
10 | 14431023412053 |
11 | 46641875556a6 |
12 | 17509b4660959 |
13 | 808abb9a0a31 |
14 | 37c67295d393 |
15 | 1a05b61c8b53 |
hex | d1ffc063355 |
14431023412053 has 8 divisors (see below), whose sum is σ = 19274711803968. Its totient is φ = 9604008647424.
The previous prime is 14431023412031. The next prime is 14431023412067. The reversal of 14431023412053 is 35021432013441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14431023412053 - 213 = 14431023403861 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14431023419053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4168404801 + ... + 4168408262.
It is an arithmetic number, because the mean of its divisors is an integer number (2409338975496).
Almost surely, 214431023412053 is an apocalyptic number.
It is an amenable number.
14431023412053 is a deficient number, since it is larger than the sum of its proper divisors (4843688391915).
14431023412053 is an equidigital number, since it uses as much as digits as its factorization.
14431023412053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8336813643.
The product of its (nonzero) digits is 34560, while the sum is 33.
Adding to 14431023412053 its reverse (35021432013441), we get a palindrome (49452455425494).
It can be divided in two parts, 14431023 and 412053, that added together give a triangular number (14843076 = T5448).
The spelling of 14431023412053 in words is "fourteen trillion, four hundred thirty-one billion, twenty-three million, four hundred twelve thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •