Base | Representation |
---|---|
bin | 1011000110101110001000… |
… | …1111111100000011110100 |
3 | 1121020021101100220102121020 |
4 | 2301223202033330003310 |
5 | 3100022232234243322 |
6 | 41545123401421140 |
7 | 2400102325035636 |
oct | 261534217740364 |
9 | 47207340812536 |
10 | 12210092884212 |
11 | 39882a9131323 |
12 | 145249349a7b0 |
13 | 6a7539a1aba2 |
14 | 302d862c0a56 |
15 | 16292c49e05c |
hex | b1ae23fc0f4 |
12210092884212 has 12 divisors (see below), whose sum is σ = 28490216729856. Its totient is φ = 4070030961400.
The previous prime is 12210092884151. The next prime is 12210092884243. The reversal of 12210092884212 is 21248829001221.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 508753870164 + ... + 508753870187.
It is an arithmetic number, because the mean of its divisors is an integer number (2374184727488).
Almost surely, 212210092884212 is an apocalyptic number.
12210092884212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12210092884212 is an abundant number, since it is smaller than the sum of its proper divisors (16280123845644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12210092884212 is a wasteful number, since it uses less digits than its factorization.
12210092884212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017507740358 (or 1017507740356 counting only the distinct ones).
The product of its (nonzero) digits is 73728, while the sum is 42.
The spelling of 12210092884212 in words is "twelve trillion, two hundred ten billion, ninety-two million, eight hundred eighty-four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •