Base | Representation |
---|---|
bin | 101101101110011100101100… |
… | …101110111110001001110010 |
3 | 222101001100120211022211120220 |
4 | 231232130230232332021302 |
5 | 202324342000034230224 |
6 | 1551413523143113510 |
7 | 60234166461265521 |
oct | 5556345456761162 |
9 | 871040524284526 |
10 | 201104004211314 |
11 | 59094802674596 |
12 | 1a67b378142896 |
13 | 882a045801659 |
14 | 37936b2c1a4b8 |
15 | 183b29b348279 |
hex | b6e72cbbe272 |
201104004211314 has 8 divisors (see below), whose sum is σ = 402208008422640. Its totient is φ = 67034668070436.
The previous prime is 201104004211307. The next prime is 201104004211321. The reversal of 201104004211314 is 413112400401102.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (201104004211307) and next prime (201104004211321).
It is a sphenic number, since it is the product of 3 distinct primes.
201104004211314 is an admirable number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16758667017604 + ... + 16758667017615.
It is an arithmetic number, because the mean of its divisors is an integer number (50276001052830).
Almost surely, 2201104004211314 is an apocalyptic number.
201104004211314 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201104004211314 is a wasteful number, since it uses less digits than its factorization.
201104004211314 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33517334035224.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 201104004211314 its reverse (413112400401102), we get a palindrome (614216404612416).
The spelling of 201104004211314 in words is "two hundred one trillion, one hundred four billion, four million, two hundred eleven thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •