Base | Representation |
---|---|
bin | 101101110010111110001110… |
… | …011011011100110101111000 |
3 | 222102011002000100200020022202 |
4 | 231302332032123130311320 |
5 | 202344440134003002431 |
6 | 1552212415141405332 |
7 | 60265513340510126 |
oct | 5562761633346570 |
9 | 872132010606282 |
10 | 201414880906616 |
11 | 591a463143aa73 |
12 | 1a70b678109848 |
13 | 8850459b44730 |
14 | 37a47646d2916 |
15 | 18443e383b8cb |
hex | b72f8e6dcd78 |
201414880906616 has 16 divisors (see below), whose sum is σ = 406703124907800. Its totient is φ = 92960714264544.
The previous prime is 201414880906607. The next prime is 201414880906621. The reversal of 201414880906616 is 616609088414102.
It is a happy number.
It is a super-2 number, since 2×2014148809066162 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 968340773486 + ... + 968340773693.
Almost surely, 2201414880906616 is an apocalyptic number.
201414880906616 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is an amenable number.
201414880906616 is an abundant number, since it is smaller than the sum of its proper divisors (205288244001184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201414880906616 is a wasteful number, since it uses less digits than its factorization.
201414880906616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1936681547198 (or 1936681547194 counting only the distinct ones).
The product of its (nonzero) digits is 3981312, while the sum is 56.
The spelling of 201414880906616 in words is "two hundred one trillion, four hundred fourteen billion, eight hundred eighty million, nine hundred six thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •