Base | Representation |
---|---|
bin | 1100111011111000110011… |
… | …1011100001100100101111 |
3 | 1212100201001101220011201012 |
4 | 3032332030323201210233 |
5 | 3331012201242200221 |
6 | 50125542335135435 |
7 | 2665402140605330 |
oct | 316761473414457 |
9 | 55321041804635 |
10 | 14223001131311 |
11 | 4593a39389215 |
12 | 171861a37457b |
13 | 7c22b963a19b |
14 | 37257b254287 |
15 | 199e8d80765b |
hex | cef8cee192f |
14223001131311 has 8 divisors (see below), whose sum is σ = 16288793425920. Its totient is φ = 12165692584248.
The previous prime is 14223001131263. The next prime is 14223001131331. The reversal of 14223001131311 is 11313110032241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-14223001131311 is a prime.
It is a super-2 number, since 2×142230011313112 (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 (14223001131331) 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, 2120933291 + ... + 2120939996.
It is an arithmetic number, because the mean of its divisors is an integer number (2036099178240).
Almost surely, 214223001131311 is an apocalyptic number.
14223001131311 is a deficient number, since it is larger than the sum of its proper divisors (2065792294609).
14223001131311 is an equidigital number, since it uses as much as digits as its factorization.
14223001131311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4241873773.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 14223001131311 its reverse (11313110032241), we get a palindrome (25536111163552).
The spelling of 14223001131311 in words is "fourteen trillion, two hundred twenty-three billion, one million, one hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •