Base | Representation |
---|---|
bin | 1010111011110001110100… |
… | …0000011010101110000100 |
3 | 1120120022010211100000122220 |
4 | 2232330131000122232010 |
5 | 3033432230112011322 |
6 | 41322513200052340 |
7 | 2350365563602503 |
oct | 256743500325604 |
9 | 46508124300586 |
10 | 12022100110212 |
11 | 39155a91077a5 |
12 | 1421b690040b0 |
13 | 6928aa1c358a |
14 | 2d7c30b7c83a |
15 | 15cac822655c |
hex | aef1d01ab84 |
12022100110212 has 48 divisors (see below), whose sum is σ = 28102955462400. Its totient is φ = 4000028286240.
The previous prime is 12022100110151. The next prime is 12022100110217. The reversal of 12022100110212 is 21201100122021.
It is a junction number, because it is equal to n+sod(n) for n = 12022100110191 and 12022100110200.
It is not an unprimeable number, because it can be changed into a prime (12022100110217) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 34672239 + ... + 35017257.
It is an arithmetic number, because the mean of its divisors is an integer number (585478238800).
Almost surely, 212022100110212 is an apocalyptic number.
12022100110212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12022100110212 is an abundant number, since it is smaller than the sum of its proper divisors (16080855352188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022100110212 is a wasteful number, since it uses less digits than its factorization.
12022100110212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 350336 (or 350334 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12022100110212 its reverse (21201100122021), we get a palindrome (33223200232233).
The spelling of 12022100110212 in words is "twelve trillion, twenty-two billion, one hundred million, one hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •