Base | Representation |
---|---|
bin | 101101101111111111011011… |
… | …010010101000110111001110 |
3 | 222101102111012200201002000110 |
4 | 231233333123102220313032 |
5 | 202333111101033340412 |
6 | 1551534334202140450 |
7 | 60244641445602051 |
oct | 5557773322506716 |
9 | 871374180632013 |
10 | 201210012011982 |
11 | 59125761279206 |
12 | 1a697a21ab1726 |
13 | 883703abab61c |
14 | 379888bb1aa98 |
15 | 183de02c0bd3c |
hex | b6ffdb4a8dce |
201210012011982 has 8 divisors (see below), whose sum is σ = 402420024023976. Its totient is φ = 67070004003992.
The previous prime is 201210012011843. The next prime is 201210012011999. The reversal of 201210012011982 is 289110210012102.
It is a sphenic number, since it is the product of 3 distinct primes.
201210012011982 is an admirable number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16767501000993 + ... + 16767501001004.
It is an arithmetic number, because the mean of its divisors is an integer number (50302503002997).
Almost surely, 2201210012011982 is an apocalyptic number.
201210012011982 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.
201210012011982 is a wasteful number, since it uses less digits than its factorization.
201210012011982 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33535002002002.
The product of its (nonzero) digits is 1152, while the sum is 30.
It can be divided in two parts, 2012100120 and 11982, that added together give a palindrome (2012112102).
The spelling of 201210012011982 in words is "two hundred one trillion, two hundred ten billion, twelve million, eleven thousand, nine hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •