Base | Representation |
---|---|
bin | 10110011000111010… |
… | …00101111011100011 |
3 | 1011000200222000100221 |
4 | 23030131011323203 |
5 | 144104122104443 |
6 | 5304424423511 |
7 | 603604163404 |
oct | 131435057343 |
9 | 34020860327 |
10 | 12020113123 |
11 | 5109049997 |
12 | 23b5617b97 |
13 | 1197387595 |
14 | 8205759ab |
15 | 4a53e4eed |
hex | 2cc745ee3 |
12020113123 has 4 divisors (see below), whose sum is σ = 12031071480. Its totient is φ = 12009154768.
The previous prime is 12020113093. The next prime is 12020113181. The reversal of 12020113123 is 32131102021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32131102021 = 17881 ⋅1796941.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12020113123 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12020113097 and 12020113106.
It is not an unprimeable number, because it can be changed into a prime (12020113423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5477533 + ... + 5479726.
It is an arithmetic number, because the mean of its divisors is an integer number (3007767870).
Almost surely, 212020113123 is an apocalyptic number.
12020113123 is a deficient number, since it is larger than the sum of its proper divisors (10958357).
12020113123 is a wasteful number, since it uses less digits than its factorization.
12020113123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10958356.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 12020113123 its reverse (32131102021), we get a palindrome (44151215144).
The spelling of 12020113123 in words is "twelve billion, twenty million, one hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •