Base | Representation |
---|---|
bin | 11101100001000001101… |
… | …00111011000111011101 |
3 | 10120221201202122201020021 |
4 | 32300200310323013131 |
5 | 113104001213321042 |
6 | 2053522225152141 |
7 | 133161622330123 |
oct | 16604064730735 |
9 | 3527652581207 |
10 | 1014163026397 |
11 | 361116653294 |
12 | 14467518b651 |
13 | 748345b7831 |
14 | 3712b439913 |
15 | 1b5a9d4d867 |
hex | ec20d3b1dd |
1014163026397 has 2 divisors, whose sum is σ = 1014163026398. Its totient is φ = 1014163026396.
The previous prime is 1014163026379. The next prime is 1014163026433. The reversal of 1014163026397 is 7936203614101.
Together with previous prime (1014163026379) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 950662050361 + 63500976036 = 975019^2 + 251994^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014163026397 - 211 = 1014163024349 is a prime.
It is a super-2 number, since 2×10141630263972 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1014163026347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 507081513198 + 507081513199.
It is an arithmetic number, because the mean of its divisors is an integer number (507081513199).
Almost surely, 21014163026397 is an apocalyptic number.
It is an amenable number.
1014163026397 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014163026397 is an equidigital number, since it uses as much as digits as its factorization.
1014163026397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 43.
The spelling of 1014163026397 in words is "one trillion, fourteen billion, one hundred sixty-three million, twenty-six thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •