Base | Representation |
---|---|
bin | 1100110101011001100001… |
… | …1000100101101100000101 |
3 | 1211222001022101021202220101 |
4 | 3031112120120211230011 |
5 | 3322200400140300041 |
6 | 50002424504404101 |
7 | 2654344503111064 |
oct | 315263030455405 |
9 | 54861271252811 |
10 | 14111524150021 |
11 | 4550733550211 |
12 | 16baaa8a76631 |
13 | 7b493214a46c |
14 | 36b003c401db |
15 | 197116c10b31 |
hex | cd598625b05 |
14111524150021 has 2 divisors, whose sum is σ = 14111524150022. Its totient is φ = 14111524150020.
The previous prime is 14111524150001. The next prime is 14111524150067. The reversal of 14111524150021 is 12005142511141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7380534957796 + 6730989192225 = 2716714^2 + 2594415^2 .
It is a cyclic number.
It is not a de Polignac number, because 14111524150021 - 27 = 14111524149893 is a prime.
It is a super-2 number, since 2×141115241500212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14111524150001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7055762075010 + 7055762075011.
It is an arithmetic number, because the mean of its divisors is an integer number (7055762075011).
Almost surely, 214111524150021 is an apocalyptic number.
It is an amenable number.
14111524150021 is a deficient number, since it is larger than the sum of its proper divisors (1).
14111524150021 is an equidigital number, since it uses as much as digits as its factorization.
14111524150021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1600, while the sum is 28.
Adding to 14111524150021 its reverse (12005142511141), we get a palindrome (26116666661162).
The spelling of 14111524150021 in words is "fourteen trillion, one hundred eleven billion, five hundred twenty-four million, one hundred fifty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •