Base | Representation |
---|---|
bin | 1100101111101010100101… |
… | …0001011100111101001111 |
3 | 1211121122001200110022011000 |
4 | 3023322221101130331033 |
5 | 3314042132422302421 |
6 | 45445254412231343 |
7 | 2644256531165223 |
oct | 313725121347517 |
9 | 54548050408130 |
10 | 14013023244111 |
11 | 4512987336751 |
12 | 16a399916b553 |
13 | 7a85650a3858 |
14 | 36633bd28783 |
15 | 19479e3e2226 |
hex | cbea945cf4f |
14013023244111 has 32 divisors (see below), whose sum is σ = 20767815717120. Its totient is φ = 9338514790752.
The previous prime is 14013023244091. The next prime is 14013023244137. The reversal of 14013023244111 is 11144232031041.
It is a happy number.
14013023244111 is a `hidden beast` number, since 1 + 4 + 0 + 1 + 302 + 3 + 244 + 111 = 666.
It is not a de Polignac number, because 14013023244111 - 223 = 14013014855503 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14013023244511) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1570434096 + ... + 1570443018.
It is an arithmetic number, because the mean of its divisors is an integer number (648994241160).
Almost surely, 214013023244111 is an apocalyptic number.
14013023244111 is a deficient number, since it is larger than the sum of its proper divisors (6754792473009).
14013023244111 is an equidigital number, since it uses as much as digits as its factorization.
14013023244111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24212 (or 24206 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 14013023244111 its reverse (11144232031041), we get a palindrome (25157255275152).
The spelling of 14013023244111 in words is "fourteen trillion, thirteen billion, twenty-three million, two hundred forty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •