Base | Representation |
---|---|
bin | 1011000000011001001110… |
… | …1011000001100011111101 |
3 | 1120211212211101211020200022 |
4 | 2300012103223001203331 |
5 | 3041232132000332143 |
6 | 41423150120341525 |
7 | 2356203661140125 |
oct | 260062353014375 |
9 | 46755741736608 |
10 | 12101400402173 |
11 | 39461a2053875 |
12 | 14353ba6148a5 |
13 | 69a20738bb64 |
14 | 2db9d4a17c85 |
15 | 15ebba07e268 |
hex | b0193ac18fd |
12101400402173 has 2 divisors, whose sum is σ = 12101400402174. Its totient is φ = 12101400402172.
The previous prime is 12101400402139. The next prime is 12101400402227. The reversal of 12101400402173 is 37120400410121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7077158845849 + 5024241556324 = 2660293^2 + 2241482^2 .
It is a cyclic number.
It is not a de Polignac number, because 12101400402173 - 28 = 12101400401917 is a prime.
It is a super-2 number, since 2×121014004021732 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12101400402373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6050700201086 + 6050700201087.
It is an arithmetic number, because the mean of its divisors is an integer number (6050700201087).
Almost surely, 212101400402173 is an apocalyptic number.
It is an amenable number.
12101400402173 is a deficient number, since it is larger than the sum of its proper divisors (1).
12101400402173 is an equidigital number, since it uses as much as digits as its factorization.
12101400402173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 26.
Adding to 12101400402173 its reverse (37120400410121), we get a palindrome (49221800812294).
The spelling of 12101400402173 in words is "twelve trillion, one hundred one billion, four hundred million, four hundred two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •