Base | Representation |
---|---|
bin | 1011000011000000000111… |
… | …1100100010101100011001 |
3 | 1121000011110120110210120001 |
4 | 2300300001330202230121 |
5 | 3043000404220123144 |
6 | 41455515354533001 |
7 | 2362351106615053 |
oct | 260600174425431 |
9 | 47004416423501 |
10 | 12146200161049 |
11 | 39631a1381789 |
12 | 1442021a37161 |
13 | 6a14c6960016 |
14 | 2ddc448408d3 |
15 | 160e3d116bd4 |
hex | b0c01f22b19 |
12146200161049 has 2 divisors, whose sum is σ = 12146200161050. Its totient is φ = 12146200161048.
The previous prime is 12146200161037. The next prime is 12146200161061. The reversal of 12146200161049 is 94016100264121.
It is a balanced prime because it is at equal distance from previous prime (12146200161037) and next prime (12146200161061).
It can be written as a sum of positive squares in only one way, i.e., 11723741760025 + 422458401024 = 3423995^2 + 649968^2 .
It is a cyclic number.
It is not a de Polignac number, because 12146200161049 - 235 = 12111840422681 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12146200160999 and 12146200161017.
It is not a weakly prime, because it can be changed into another prime (12146600161049) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6073100080524 + 6073100080525.
It is an arithmetic number, because the mean of its divisors is an integer number (6073100080525).
Almost surely, 212146200161049 is an apocalyptic number.
It is an amenable number.
12146200161049 is a deficient number, since it is larger than the sum of its proper divisors (1).
12146200161049 is an equidigital number, since it uses as much as digits as its factorization.
12146200161049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20736, while the sum is 37.
The spelling of 12146200161049 in words is "twelve trillion, one hundred forty-six billion, two hundred million, one hundred sixty-one thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •