Base | Representation |
---|---|
bin | 101111001100010001… |
… | …0100000101011101001 |
3 | 100200120210112201200021 |
4 | 1132120202200223221 |
5 | 3130022404301101 |
6 | 114320113240441 |
7 | 10215245645062 |
oct | 1363042405351 |
9 | 320523481607 |
10 | 101343431401 |
11 | 39a857a7a93 |
12 | 17783863121 |
13 | 9730c43074 |
14 | 4c95649569 |
15 | 29821585a1 |
hex | 17988a0ae9 |
101343431401 has 2 divisors, whose sum is σ = 101343431402. Its totient is φ = 101343431400.
The previous prime is 101343431377. The next prime is 101343431471. The reversal of 101343431401 is 104134343101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95849064025 + 5494367376 = 309595^2 + 74124^2 .
It is an emirp because it is prime and its reverse (104134343101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101343431401 - 235 = 66983693033 is a prime.
It is not a weakly prime, because it can be changed into another prime (101343431471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50671715700 + 50671715701.
It is an arithmetic number, because the mean of its divisors is an integer number (50671715701).
Almost surely, 2101343431401 is an apocalyptic number.
It is an amenable number.
101343431401 is a deficient number, since it is larger than the sum of its proper divisors (1).
101343431401 is an equidigital number, since it uses as much as digits as its factorization.
101343431401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 101343431401 its reverse (104134343101), we get a palindrome (205477774502).
The spelling of 101343431401 in words is "one hundred one billion, three hundred forty-three million, four hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •