Base | Representation |
---|---|
bin | 11010010010010010… |
… | …00000110001100011 |
3 | 1100102111012221020021 |
4 | 31021021000301203 |
5 | 212400133013443 |
6 | 10252153054311 |
7 | 1006465013263 |
oct | 151111006143 |
9 | 40374187207 |
10 | 14112001123 |
11 | 5a91947350 |
12 | 289a0b7397 |
13 | 143b89502c |
14 | 97c30d7a3 |
15 | 578da89ed |
hex | 349240c63 |
14112001123 has 4 divisors (see below), whose sum is σ = 15394910328. Its totient is φ = 12829091920.
The previous prime is 14112001097. The next prime is 14112001129. The reversal of 14112001123 is 32110021141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14112001123 - 25 = 14112001091 is a prime.
It is a super-2 number, since 2×141120011232 (a number of 21 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 = 14112001097 and 14112001106.
It is not an unprimeable number, because it can be changed into a prime (14112001129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 641454586 + ... + 641454607.
It is an arithmetic number, because the mean of its divisors is an integer number (3848727582).
Almost surely, 214112001123 is an apocalyptic number.
14112001123 is a deficient number, since it is larger than the sum of its proper divisors (1282909205).
14112001123 is a wasteful number, since it uses less digits than its factorization.
14112001123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1282909204.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 14112001123 its reverse (32110021141), we get a palindrome (46222022264).
The spelling of 14112001123 in words is "fourteen billion, one hundred twelve million, one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •