Base | Representation |
---|---|
bin | 1100110001010100010111… |
… | …0111001111110011111101 |
3 | 1211201100100201100012001221 |
4 | 3030111011313033303331 |
5 | 3320023312032414323 |
6 | 45510312301433341 |
7 | 2646313324301506 |
oct | 314250567176375 |
9 | 54640321305057 |
10 | 14041420201213 |
11 | 4523a2970a939 |
12 | 16a93a326b851 |
13 | 7ab13c308b52 |
14 | 3678734c9bad |
15 | 1953b241a55d |
hex | cc545dcfcfd |
14041420201213 has 8 divisors (see below), whose sum is σ = 15089287381632. Its totient is φ = 13018208719296.
The previous prime is 14041420201199. The next prime is 14041420201223. The reversal of 14041420201213 is 31210202414041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14041420201213 - 217 = 14041420070141 is a prime.
It is a super-2 number, since 2×140414202012132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14041420201223) 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, 6163923445 + ... + 6163925722.
It is an arithmetic number, because the mean of its divisors is an integer number (1886160922704).
Almost surely, 214041420201213 is an apocalyptic number.
It is an amenable number.
14041420201213 is a deficient number, since it is larger than the sum of its proper divisors (1047867180419).
14041420201213 is a wasteful number, since it uses less digits than its factorization.
14041420201213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12327849251.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 14041420201213 its reverse (31210202414041), we get a palindrome (45251622615254).
The spelling of 14041420201213 in words is "fourteen trillion, forty-one billion, four hundred twenty million, two hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •