Base | Representation |
---|---|
bin | 1100110111001000011101… |
… | …1010111110011011011001 |
3 | 1212001220011210221212102220 |
4 | 3031302013122332123121 |
5 | 3323142342402142131 |
6 | 50024231525214253 |
7 | 2656450463361033 |
oct | 315620732763331 |
9 | 55056153855386 |
10 | 14141304334041 |
11 | 45623256a7245 |
12 | 170481a261389 |
13 | 7b7699b0a821 |
14 | 36c62adc8c53 |
15 | 197cab3b8e96 |
hex | cdc876be6d9 |
14141304334041 has 16 divisors (see below), whose sum is σ = 18971061534720. Its totient is φ = 9369543592080.
The previous prime is 14141304333979. The next prime is 14141304334051. The reversal of 14141304334041 is 14043340314141.
It is not a de Polignac number, because 14141304334041 - 211 = 14141304331993 is a prime.
It is a super-2 number, since 2×141413043340412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14141304333993 and 14141304334011.
It is not an unprimeable number, because it can be changed into a prime (14141304334051) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34510920 + ... + 34918278.
It is an arithmetic number, because the mean of its divisors is an integer number (1185691345920).
Almost surely, 214141304334041 is an apocalyptic number.
It is an amenable number.
14141304334041 is a deficient number, since it is larger than the sum of its proper divisors (4829757200679).
14141304334041 is a wasteful number, since it uses less digits than its factorization.
14141304334041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 478516.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 14141304334041 its reverse (14043340314141), we get a palindrome (28184644648182).
The spelling of 14141304334041 in words is "fourteen trillion, one hundred forty-one billion, three hundred four million, three hundred thirty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •