Base | Representation |
---|---|
bin | 11001111110000000001110… |
… | …010110110111011010110101 |
3 | 112222101120011102201212200212 |
4 | 121332000032112313122311 |
5 | 104432222144332213141 |
6 | 1042524135033515205 |
7 | 33025355052214115 |
oct | 3176001626673265 |
9 | 488346142655625 |
10 | 114212011210421 |
11 | 33434050911143 |
12 | 10987077572b05 |
13 | 4b961b9977357 |
14 | 202bc6865b045 |
15 | d30db33792eb |
hex | 67e00e5b76b5 |
114212011210421 has 8 divisors (see below), whose sum is σ = 127295120854080. Its totient is φ = 101836096682688.
The previous prime is 114212011210411. The next prime is 114212011210441. The reversal of 114212011210421 is 124012110212411.
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 114212011210421 - 26 = 114212011210357 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114212011210411) 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, 176798778641 + ... + 176798779286.
It is an arithmetic number, because the mean of its divisors is an integer number (15911890106760).
Almost surely, 2114212011210421 is an apocalyptic number.
It is an amenable number.
114212011210421 is a deficient number, since it is larger than the sum of its proper divisors (13083109643659).
114212011210421 is a wasteful number, since it uses less digits than its factorization.
114212011210421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 353597557963.
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 114212011210421 its reverse (124012110212411), we get a palindrome (238224121422832).
The spelling of 114212011210421 in words is "one hundred fourteen trillion, two hundred twelve billion, eleven million, two hundred ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •