Base | Representation |
---|---|
bin | 1011000011110111110101… |
… | …0101001010110001011001 |
3 | 1121001121001210212020012221 |
4 | 2300331331111022301121 |
5 | 3043222021202203441 |
6 | 41510431343304041 |
7 | 2363420521625134 |
oct | 260757525126131 |
9 | 47047053766187 |
10 | 12161155116121 |
11 | 3969576027890 |
12 | 1444ab62ab021 |
13 | 6a2a3b06716b |
14 | 300862a9b21b |
15 | 161515ece8d1 |
hex | b0f7d54ac59 |
12161155116121 has 4 divisors (see below), whose sum is σ = 13266714672144. Its totient is φ = 11055595560100.
The previous prime is 12161155116079. The next prime is 12161155116157.
12161155116121 is nontrivially palindromic in base 10.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12161155116121 - 29 = 12161155115609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12161155116181) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 552779777995 + ... + 552779778016.
It is an arithmetic number, because the mean of its divisors is an integer number (3316678668036).
Almost surely, 212161155116121 is an apocalyptic number.
12161155116121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12161155116121 is a deficient number, since it is larger than the sum of its proper divisors (1105559556023).
12161155116121 is a wasteful number, since it uses less digits than its factorization.
12161155116121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1105559556022.
The product of its digits is 3600, while the sum is 34.
The spelling of 12161155116121 in words is "twelve trillion, one hundred sixty-one billion, one hundred fifty-five million, one hundred sixteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •