Base | Representation |
---|---|
bin | 1100000100010… |
… | …11100011010001 |
3 | 21001111021011122 |
4 | 12002023203101 |
5 | 201404004042 |
6 | 14013452025 |
7 | 2336324321 |
oct | 602134321 |
9 | 231437148 |
10 | 101234897 |
11 | 52165305 |
12 | 29aa1015 |
13 | 17c8690a |
14 | d633281 |
15 | 8d4a7d2 |
hex | 608b8d1 |
101234897 has 2 divisors, whose sum is σ = 101234898. Its totient is φ = 101234896.
The previous prime is 101234879. The next prime is 101234909. The reversal of 101234897 is 798432101.
Together with previous prime (101234879) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96904336 + 4330561 = 9844^2 + 2081^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101234897 is a prime.
It is not a weakly prime, because it can be changed into another prime (101234297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50617448 + 50617449.
It is an arithmetic number, because the mean of its divisors is an integer number (50617449).
Almost surely, 2101234897 is an apocalyptic number.
It is an amenable number.
101234897 is a deficient number, since it is larger than the sum of its proper divisors (1).
101234897 is an equidigital number, since it uses as much as digits as its factorization.
101234897 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 35.
The square root of 101234897 is about 10061.5553966571. Note that the first 3 decimals coincide. The cubic root of 101234897 is about 466.0617001567.
Adding to 101234897 its reverse (798432101), we get a palindrome (899666998).
The spelling of 101234897 in words is "one hundred one million, two hundred thirty-four thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •