Base | Representation |
---|---|
bin | 10110100100000110… |
… | …11011110001001001 |
3 | 1011021020201111201000 |
4 | 23102003123301021 |
5 | 144302144100441 |
6 | 5322022045213 |
7 | 606124504245 |
oct | 132203336111 |
9 | 34236644630 |
10 | 12114050121 |
11 | 515707a178 |
12 | 2420b79809 |
13 | 11b09874c4 |
14 | 82cc29425 |
15 | 4ad79d2b6 |
hex | 2d20dbc49 |
12114050121 has 16 divisors (see below), whose sum is σ = 17948980800. Its totient is φ = 8075025504.
The previous prime is 12114050119. The next prime is 12114050129. The reversal of 12114050121 is 12105041121.
12114050121 is a `hidden beast` number, since 1 + 2 + 1 + 140 + 501 + 21 = 666.
It is not a de Polignac number, because 12114050121 - 21 = 12114050119 is a prime.
It is a super-3 number, since 3×121140501213 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12114050094 and 12114050103.
It is not an unprimeable number, because it can be changed into a prime (12114050129) 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, 238450 + ... + 284756.
It is an arithmetic number, because the mean of its divisors is an integer number (1121811300).
Almost surely, 212114050121 is an apocalyptic number.
It is an amenable number.
12114050121 is a deficient number, since it is larger than the sum of its proper divisors (5834930679).
12114050121 is an equidigital number, since it uses as much as digits as its factorization.
12114050121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56005 (or 55999 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 18.
Adding to 12114050121 its reverse (12105041121), we get a palindrome (24219091242).
The spelling of 12114050121 in words is "twelve billion, one hundred fourteen million, fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •