Base | Representation |
---|---|
bin | 10110100011110111… |
… | …11111111010011100 |
3 | 1011021010001111001002 |
4 | 23101323333322130 |
5 | 144301144213040 |
6 | 5321512205432 |
7 | 606102105605 |
oct | 132173777234 |
9 | 34233044032 |
10 | 12112101020 |
11 | 5155a68848 |
12 | 2420399878 |
13 | 11b04542a6 |
14 | 82c87cdac |
15 | 4ad515a15 |
hex | 2d1effe9c |
12112101020 has 24 divisors (see below), whose sum is σ = 25441819200. Its totient is φ = 4843620032.
The previous prime is 12112100999. The next prime is 12112101031. The reversal of 12112101020 is 2010121121.
It is a super-2 number, since 2×121121010202 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12112100992 and 12112101010.
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 7 ways as a sum of consecutive naturals, for example, 7346 + ... + 155814.
It is an arithmetic number, because the mean of its divisors is an integer number (1060075800).
Almost surely, 212112101020 is an apocalyptic number.
12112101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12112101020 is an abundant number, since it is smaller than the sum of its proper divisors (13329718180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12112101020 is a wasteful number, since it uses less digits than its factorization.
12112101020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152557 (or 152555 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 12112101020 its reverse (2010121121), we get a palindrome (14122222141).
The spelling of 12112101020 in words is "twelve billion, one hundred twelve million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •