Base | Representation |
---|---|
bin | 11001111100011011101111… |
… | …100010101001010011001101 |
3 | 112222000020200022102122021112 |
4 | 121330123233202221103031 |
5 | 104423440214211202341 |
6 | 1042402413055141405 |
7 | 33014515315231040 |
oct | 3174335742512315 |
9 | 488006608378245 |
10 | 114104120022221 |
11 | 333a23160785aa |
12 | 1096a186b14865 |
13 | 4b88c843320a4 |
14 | 2026951578c57 |
15 | d2d19b489aeb |
hex | 67c6ef8a94cd |
114104120022221 has 8 divisors (see below), whose sum is σ = 131670773729664. Its totient is φ = 96853982598000.
The previous prime is 114104120022187. The next prime is 114104120022239. The reversal of 114104120022221 is 122220021401411.
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 114104120022221 - 26 = 114104120022157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114104120022241) 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, 79129070030 + ... + 79129071471.
It is an arithmetic number, because the mean of its divisors is an integer number (16458846716208).
Almost surely, 2114104120022221 is an apocalyptic number.
It is an amenable number.
114104120022221 is a deficient number, since it is larger than the sum of its proper divisors (17566653707443).
114104120022221 is a wasteful number, since it uses less digits than its factorization.
114104120022221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158258141611.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 114104120022221 its reverse (122220021401411), we get a palindrome (236324141423632).
The spelling of 114104120022221 in words is "one hundred fourteen trillion, one hundred four billion, one hundred twenty million, twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •