Base | Representation |
---|---|
bin | 1100110101100011111000… |
… | …1110111011101010001111 |
3 | 1211222022111022000201200121 |
4 | 3031120332032323222033 |
5 | 3322222044444331211 |
6 | 50004004543005411 |
7 | 2654503450624261 |
oct | 315307616735217 |
9 | 54868438021617 |
10 | 14114306636431 |
11 | 4551931156461 |
12 | 16bb544899867 |
13 | 7b4c86754c21 |
14 | 36b1c95c5b31 |
15 | 19722b13b271 |
hex | cd63e3bba8f |
14114306636431 has 4 divisors (see below), whose sum is σ = 14118292606264. Its totient is φ = 14110320666600.
The previous prime is 14114306636429. The next prime is 14114306636453. The reversal of 14114306636431 is 13463660341141.
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 14114306636431 - 21 = 14114306636429 is a prime.
It is a super-2 number, since 2×141143066364312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14114306636411) 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, 1992979605 + ... + 1992986686.
It is an arithmetic number, because the mean of its divisors is an integer number (3529573151566).
Almost surely, 214114306636431 is an apocalyptic number.
14114306636431 is a deficient number, since it is larger than the sum of its proper divisors (3985969833).
14114306636431 is an equidigital number, since it uses as much as digits as its factorization.
14114306636431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3985969832.
The product of its (nonzero) digits is 373248, while the sum is 43.
Adding to 14114306636431 its reverse (13463660341141), we get a palindrome (27577966977572).
The spelling of 14114306636431 in words is "fourteen trillion, one hundred fourteen billion, three hundred six million, six hundred thirty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •