Base | Representation |
---|---|
bin | 10111000010101100100110… |
… | …100011101010111101010111 |
3 | 111021211001021201211112021221 |
4 | 113002230212203222331113 |
5 | 101240330114424444302 |
6 | 555311045343351211 |
7 | 30226413406143442 |
oct | 2702544643527527 |
9 | 437731251745257 |
10 | 101340400234327 |
11 | 2a321249aa2381 |
12 | b448546bb2507 |
13 | 44714881b6a87 |
14 | 1b04c89b90659 |
15 | bab16a3d9937 |
hex | 5c2b268eaf57 |
101340400234327 has 2 divisors, whose sum is σ = 101340400234328. Its totient is φ = 101340400234326.
The previous prime is 101340400234313. The next prime is 101340400234453. The reversal of 101340400234327 is 723432004043101.
It is a weak prime.
It is an emirp because it is prime and its reverse (723432004043101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101340400234327 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101340400234292 and 101340400234301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101340400634327) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50670200117163 + 50670200117164.
It is an arithmetic number, because the mean of its divisors is an integer number (50670200117164).
Almost surely, 2101340400234327 is an apocalyptic number.
101340400234327 is a deficient number, since it is larger than the sum of its proper divisors (1).
101340400234327 is an equidigital number, since it uses as much as digits as its factorization.
101340400234327 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48384, while the sum is 34.
Adding to 101340400234327 its reverse (723432004043101), we get a palindrome (824772404277428).
The spelling of 101340400234327 in words is "one hundred one trillion, three hundred forty billion, four hundred million, two hundred thirty-four thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •