Base | Representation |
---|---|
bin | 1100111000011011100011… |
… | …1100110011001110101111 |
3 | 1212011000202100020020221122 |
4 | 3032012320330303032233 |
5 | 3324024033142334020 |
6 | 50042401143451155 |
7 | 2661200314421216 |
oct | 316067074631657 |
9 | 55130670206848 |
10 | 14163610121135 |
11 | 457083173a232 |
12 | 1709004456abb |
13 | 7b9813105707 |
14 | 36d74560807d |
15 | 19866479b125 |
hex | ce1b8f333af |
14163610121135 has 8 divisors (see below), whose sum is σ = 17211475590720. Its totient is φ = 11187459133344.
The previous prime is 14163610121081. The next prime is 14163610121137. The reversal of 14163610121135 is 53112101636141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14163610121135 - 214 = 14163610104751 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14163610121095 and 14163610121104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14163610121137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 17928620012 + ... + 17928620801.
It is an arithmetic number, because the mean of its divisors is an integer number (2151434448840).
Almost surely, 214163610121135 is an apocalyptic number.
14163610121135 is a deficient number, since it is larger than the sum of its proper divisors (3047865469585).
14163610121135 is an equidigital number, since it uses as much as digits as its factorization.
14163610121135 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35857240897.
The product of its (nonzero) digits is 12960, while the sum is 35.
Adding to 14163610121135 its reverse (53112101636141), we get a palindrome (67275711757276).
The spelling of 14163610121135 in words is "fourteen trillion, one hundred sixty-three billion, six hundred ten million, one hundred twenty-one thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •