Base | Representation |
---|---|
bin | 1100110111001111101001… |
… | …0010010011100111000111 |
3 | 1212002002011010011001200201 |
4 | 3031303322102103213013 |
5 | 3323210314222110401 |
6 | 50025151045551331 |
7 | 2656546313460505 |
oct | 315637222234707 |
9 | 55062133131621 |
10 | 14143231441351 |
11 | 4563124487511 |
12 | 1705077715547 |
13 | 7b79161427cc |
14 | 36c770d0b675 |
15 | 197d7067db01 |
hex | cdcfa4939c7 |
14143231441351 has 4 divisors (see below), whose sum is σ = 14143278718512. Its totient is φ = 14143184164192.
The previous prime is 14143231441349. The next prime is 14143231441397. The reversal of 14143231441351 is 15314413234141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14143231441351 - 21 = 14143231441349 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 14143231441351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14143231441051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23186971 + ... + 23789116.
It is an arithmetic number, because the mean of its divisors is an integer number (3535819679628).
Almost surely, 214143231441351 is an apocalyptic number.
14143231441351 is a deficient number, since it is larger than the sum of its proper divisors (47277161).
14143231441351 is an equidigital number, since it uses as much as digits as its factorization.
14143231441351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47277160.
The product of its digits is 69120, while the sum is 37.
Adding to 14143231441351 its reverse (15314413234141), we get a palindrome (29457644675492).
The spelling of 14143231441351 in words is "fourteen trillion, one hundred forty-three billion, two hundred thirty-one million, four hundred forty-one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •