Base | Representation |
---|---|
bin | 1100110101100011100010… |
… | …1110000001110111011111 |
3 | 1211222022020211221122220011 |
4 | 3031120320232001313133 |
5 | 3322221402304000043 |
6 | 50003551440104051 |
7 | 2654501245401565 |
oct | 315307056016737 |
9 | 54868224848804 |
10 | 14114214125023 |
11 | 4551893a0a251 |
12 | 16bb519905027 |
13 | 7b4c70533b4c |
14 | 36b1bb1c3a35 |
15 | 197222e6559d |
hex | cd638b81ddf |
14114214125023 has 4 divisors (see below), whose sum is σ = 14125096326880. Its totient is φ = 14103331923168.
The previous prime is 14114214124979. The next prime is 14114214125101. The reversal of 14114214125023 is 32052141241141.
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 14114214125023 - 225 = 14114180570591 is a prime.
It is a super-2 number, since 2×141142141250232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14114214125423) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5441098983 + ... + 5441101576.
It is an arithmetic number, because the mean of its divisors is an integer number (3531274081720).
Almost surely, 214114214125023 is an apocalyptic number.
14114214125023 is a deficient number, since it is larger than the sum of its proper divisors (10882201857).
14114214125023 is a wasteful number, since it uses less digits than its factorization.
14114214125023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10882201856.
The product of its (nonzero) digits is 7680, while the sum is 31.
Adding to 14114214125023 its reverse (32052141241141), we get a palindrome (46166355366164).
The spelling of 14114214125023 in words is "fourteen trillion, one hundred fourteen billion, two hundred fourteen million, one hundred twenty-five thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •