Base | Representation |
---|---|
bin | 10111000000111000110000… |
… | …001001101001111100101001 |
3 | 111021101011012120021100110122 |
4 | 113000320300021221330221 |
5 | 101231310340311310032 |
6 | 555133554115453025 |
7 | 30214421004223355 |
oct | 2700706011517451 |
9 | 437334176240418 |
10 | 101216007135017 |
11 | 2a283516371775 |
12 | b42840bbb7175 |
13 | 4462822b14678 |
14 | 1adcc49208465 |
15 | ba7cd9910012 |
hex | 5c0e30269f29 |
101216007135017 has 2 divisors, whose sum is σ = 101216007135018. Its totient is φ = 101216007135016.
The previous prime is 101216007135007. The next prime is 101216007135121. The reversal of 101216007135017 is 710531700612101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100971467983936 + 244539151081 = 10048456^2 + 494509^2 .
It is an emirp because it is prime and its reverse (710531700612101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101216007135017 - 226 = 101215940026153 is a prime.
It is not a weakly prime, because it can be changed into another prime (101216007135007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50608003567508 + 50608003567509.
It is an arithmetic number, because the mean of its divisors is an integer number (50608003567509).
Almost surely, 2101216007135017 is an apocalyptic number.
It is an amenable number.
101216007135017 is a deficient number, since it is larger than the sum of its proper divisors (1).
101216007135017 is an equidigital number, since it uses as much as digits as its factorization.
101216007135017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8820, while the sum is 35.
Adding to 101216007135017 its reverse (710531700612101), we get a palindrome (811747707747118).
The spelling of 101216007135017 in words is "one hundred one trillion, two hundred sixteen billion, seven million, one hundred thirty-five thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •