Base | Representation |
---|---|
bin | 110000101010010100000101… |
… | …101001000001011001111011 |
3 | 1001001202112121000201102210221 |
4 | 300222110011221001121323 |
5 | 211022401203112011443 |
6 | 2035100403350320511 |
7 | 63036000632205403 |
oct | 6052240551013173 |
9 | 1031675530642727 |
10 | 214014020032123 |
11 | 62211921a79643 |
12 | 20005426359137 |
13 | 9255587a1690c |
14 | 3abc4960a1803 |
15 | 19b1ee0c2aeed |
hex | c2a505a4167b |
214014020032123 has 8 divisors (see below), whose sum is σ = 223319381292288. Its totient is φ = 204708692427624.
The previous prime is 214014020032117. The next prime is 214014020032139. The reversal of 214014020032123 is 321230020410412.
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 214014020032123 - 29 = 214014020031611 is a prime.
It is not an unprimeable number, because it can be changed into a prime (214014026032123) 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, 5038036 + ... + 21293422.
It is an arithmetic number, because the mean of its divisors is an integer number (27914922661536).
Almost surely, 2214014020032123 is an apocalyptic number.
214014020032123 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
214014020032123 is a deficient number, since it is larger than the sum of its proper divisors (9305361260165).
214014020032123 is a wasteful number, since it uses less digits than its factorization.
214014020032123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16827833.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 214014020032123 its reverse (321230020410412), we get a palindrome (535244040442535).
The spelling of 214014020032123 in words is "two hundred fourteen trillion, fourteen billion, twenty million, thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •