Base | Representation |
---|---|
bin | 1100101111100011100110… |
… | …0111101000111110101011 |
3 | 1211121110020010122021020012 |
4 | 3023320321213220332223 |
5 | 3314024313400343311 |
6 | 45444344454322135 |
7 | 2644162234034123 |
oct | 313707147507653 |
9 | 54543203567205 |
10 | 14011150012331 |
11 | 4512105a03a0a |
12 | 16a355595934b |
13 | 7a8326c82c94 |
14 | 36620122bc83 |
15 | 1946dec2078b |
hex | cbe399e8fab |
14011150012331 has 24 divisors (see below), whose sum is σ = 15310928525760. Its totient is φ = 12776870840832.
The previous prime is 14011150012193. The next prime is 14011150012373. The reversal of 14011150012331 is 13321005111041.
It is a de Polignac number, because none of the positive numbers 2k-14011150012331 is a prime.
It is a super-2 number, since 2×140111500123312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14011150012297 and 14011150012306.
It is not an unprimeable number, because it can be changed into a prime (14011150018331) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4302761 + ... + 6821733.
It is an arithmetic number, because the mean of its divisors is an integer number (637955355240).
Almost surely, 214011150012331 is an apocalyptic number.
14011150012331 is a deficient number, since it is larger than the sum of its proper divisors (1299778513429).
14011150012331 is a wasteful number, since it uses less digits than its factorization.
14011150012331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2519303 (or 2519266 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 14011150012331 its reverse (13321005111041), we get a palindrome (27332155123372).
The spelling of 14011150012331 in words is "fourteen trillion, eleven billion, one hundred fifty million, twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •