Base | Representation |
---|---|
bin | 101111001011000010… |
… | …1101011111101110101 |
3 | 100200110221012002211022 |
4 | 1132112011223331311 |
5 | 3124431343233023 |
6 | 114312044150525 |
7 | 10214236343525 |
oct | 1362605537565 |
9 | 320427162738 |
10 | 101302321013 |
11 | 39a64579163 |
12 | 17771b38445 |
13 | 972557acaa |
14 | 4c8ddc7685 |
15 | 297d7377c8 |
hex | 179616bf75 |
101302321013 has 2 divisors, whose sum is σ = 101302321014. Its totient is φ = 101302321012.
The previous prime is 101302320961. The next prime is 101302321027. The reversal of 101302321013 is 310123203101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56350688689 + 44951632324 = 237383^2 + 212018^2 .
It is a cyclic number.
It is not a de Polignac number, because 101302321013 - 212 = 101302316917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101302320982 and 101302321000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101302321063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50651160506 + 50651160507.
It is an arithmetic number, because the mean of its divisors is an integer number (50651160507).
Almost surely, 2101302321013 is an apocalyptic number.
It is an amenable number.
101302321013 is a deficient number, since it is larger than the sum of its proper divisors (1).
101302321013 is an equidigital number, since it uses as much as digits as its factorization.
101302321013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 101302321013 its reverse (310123203101), we get a palindrome (411425524114).
The spelling of 101302321013 in words is "one hundred one billion, three hundred two million, three hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •