Base | Representation |
---|---|
bin | 10111000010011010101000… |
… | …110101110110010100100011 |
3 | 111021202012111110010010001101 |
4 | 113002122220311312110203 |
5 | 101240021113431413214 |
6 | 555254135332415231 |
7 | 30225131406105031 |
oct | 2702325065662443 |
9 | 437665443103041 |
10 | 101321111201059 |
11 | 2a314050923172 |
12 | b444863177517 |
13 | 446c702bbb119 |
14 | 1b03d7a099551 |
15 | baa8dbcaa774 |
hex | 5c26a8d76523 |
101321111201059 has 2 divisors, whose sum is σ = 101321111201060. Its totient is φ = 101321111201058.
The previous prime is 101321111201041. The next prime is 101321111201203. The reversal of 101321111201059 is 950102111123101.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101321111201059 - 27 = 101321111200931 is a prime.
It is not a weakly prime, because it can be changed into another prime (101321114201059) 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, 50660555600529 + 50660555600530.
It is an arithmetic number, because the mean of its divisors is an integer number (50660555600530).
Almost surely, 2101321111201059 is an apocalyptic number.
101321111201059 is a deficient number, since it is larger than the sum of its proper divisors (1).
101321111201059 is an equidigital number, since it uses as much as digits as its factorization.
101321111201059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 28.
The spelling of 101321111201059 in words is "one hundred one trillion, three hundred twenty-one billion, one hundred eleven million, two hundred one thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •